Approximation algorithms for geometric median problems
Information Processing Letters
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Journal of Algorithms
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of 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
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
SIAM Journal on Computing
Approximation Algorithms for Metric Facility Location Problems
SIAM Journal on Computing
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A 1.488 approximation algorithm for the uncapacitated facility location problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Hi-index | 0.00 |
We present a 1.488-approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously, the best algorithm was due to Byrka (2007). Byrka proposed an algorithm parametrized by @c and used it with @c~1.6774. By either running his algorithm or the algorithm proposed by Jain, Mahdian and Saberi (STOC@?02), Byrka obtained an algorithm that gives expected approximation ratio 1.5. We show that if @c is randomly selected, the approximation ratio can be improved to 1.488. Our algorithm cuts the gap with the 1.463 approximability lower bound by almost 1/3.