Planar geometric location problems
- 1 February 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 11 (2), 185-195
- https://doi.org/10.1007/bf01182774
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A convex polygon among polygonal obstacles: placement and high-clearance motionComputational Geometry, 1993
- Selecting distances in the planeAlgorithmica, 1993
- Finding tailored partitionsJournal of Algorithms, 1991
- Off-line dynamic maintenance of the width of a planar point setComputational Geometry, 1991
- Optimal algorithms for approximate clusteringPublished by Association for Computing Machinery (ACM) ,1988
- Geometric complexity of some location problemsAlgorithmica, 1986
- The Planar Two-Center and Two-Median ProblemsTransportation Science, 1984
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983