On the Complexity of Some Common Geometric Location Problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
An Algorithmic Approach to Network Location Problems. II: Thep-Medians
1979 • 1,282 citations
Closest-point problems
1975 • 1,071 citations
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
1983 • 818 citations
The Euclidean travelling salesman problem is NP-complete
1977 • 738 citations
An Algorithmic Approach to Network Location Problems. I: Thep-Centers
1979 • 505 citations
Some NP-complete geometric problems
1976 • 400 citations
Geometrical Solutions for Some Minimax Location Problems
1972 • 345 citations
The Maximum Coverage Location Problem
1983 • 257 citations
Worst-Case and Probabilistic Analysis of a Geometric Location Problem
1981 • 150 citations
An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
1981 • 140 citations
Optimal location of a single service center of certain types
1971 • 43 citations
Topics in computational geometry
1981 • 23 citations