Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
SIAM Journal on Computing
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Estimating the weight of metric minimum spanning trees in sublinear-time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
SIAM Journal on Computing
A distributed O(1)-approximation algorithm for the uniform facility location problem
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
The Kinetic Facility Location Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Separating Sublinear Time Computations by Approximate Diameter
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Facility Location in Dynamic Geometric Data Streams
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Small space representations for metric min-sum k-clustering and their applications
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Property testing
Property testing
Memoryless facility location in one pass
ACM Transactions on Algorithms (TALG)
Memoryless facility location in one pass
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Super-fast distributed algorithms for metric facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
| Hi-index | 0.01 |
In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location problem, in the case of uniform costs and uniform demands, and in which every point can open a facility. By exploiting the fact that we are approximating the optimal cost without computing an actual solution, we give the first algorithm for this problem with running time O(n log2n), where n is the number of metric space points. Since the size of the representation of an n-point metric space is Θ(n2), the complexity of our algorithm is sublinear with respect to the input size. We consider also the general version of the metric Minimum Facility Location problem and we show that there is no o(n2)-time algorithm, even a randomized one, that approximates the optimal solution to within any factor. This result can be generalized to some related problems, and in particular, the cost of minimum-cost matching, the cost of bi-chromatic matching, or the cost of n/2-median cannot be approximated in o(n2)-time.