Abstract
In this paper we present a 1.52-approximation algorithm for the uncapacitated metric facility location problem. This algorithm uses an idea of cost scaling, a greedy algorithm of Jain, Mahdian and Saberi, and a greedy augmentation procedure of Charikar, Guha and Khuller. We also present a 2.89-approximation for the capacitated metric facility location problem with soft capacities.
Cite
CITATION STYLE
Mahdian, M., Ye, Y., & Zhang, J. (2002). Improved approximation algorithms for metric facility location problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2462, pp. 229–242). Springer Verlag. https://doi.org/10.1007/3-540-45753-4_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
