On the Complexity of Some Common Geometric Location Problems
- 1 February 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (1) , 182-196
- https://doi.org/10.1137/0213014
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- The Maximum Coverage Location ProblemSIAM Journal on Algebraic Discrete Methods, 1983
- Worst-Case and Probabilistic Analysis of a Geometric Location ProblemSIAM Journal on Computing, 1981
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location ProblemsSIAM Journal on Computing, 1981
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972
- Optimal location of a single service center of certain typesNaval Research Logistics Quarterly, 1971