A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- Cite this paper as:
- Li S. (2011) A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem. In: Aceto L., Henzinger M., Sgall J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6756. Springer, Berlin, Heidelberg
We present a 1.488 approximation algorithm for the metric uncapacitated facility location (UFL) problem. Previously the best algorithm was due to Byrka . 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 , 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.
KeywordsApproximation Facility Location Problem Theory
Unable to display preview. Download preview PDF.