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
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
Improved LP-rounding approximation algorithm for k-level uncapacitated facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A dependent LP-rounding approach for the k-median problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
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
New approximation algorithms for the unsplittable capacitated facility location problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A 1.488 approximation algorithm for the uncapacitated facility location problem
Information and Computation
Theoretical Computer Science
Approximating k-median via pseudo-approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A cross-monotonic cost-sharing scheme for the concave facility location game
Journal of Global Optimization
Approximation Algorithms for Integrated Distribution Network Design Problems
INFORMS Journal on Computing
Approximating the reliable resource allocation problem using inverse dual fitting
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Improved approximation algorithms for constrained fault-tolerant resource allocation
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Journal of Combinatorial Optimization
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 [1]. By linearly combining two algorithms A1(γf) for γf ≈ 1.6774 and the (1.11, 1.78)-approximation algorithm A2 proposed by Jain, Mahdian and Saberi [8], Byrka gave a 1.5 approximation algorithm for the UFL problem. We show that if γf is randomly selected from some distribution, 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.