Geometric complexity of some location problems
- 1 November 1986
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 1 (1-4) , 193-211
- https://doi.org/10.1007/bf01840442
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An efficient algorith for determining the convex hull of a finite planar setPublished by Elsevier ,2002
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- The complexity of problems on probabilistic, nondeterministic, and alternating decision treesJournal of the ACM, 1985
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- Location of multiple points in a planar subdivisionInformation Processing Letters, 1979
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972