A 1.488 approximation algorithm for the uncapacitated facility location problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6756 LNCS, Issue PART 2, 2011, Pages 77-88

  Li, Shi ^a  

^a Princeton University   (United States)

Author keywords

Approximation; Facility Location Problem; Theory

Indexed keywords

APPROXIMABILITY; APPROXIMATION; APPROXIMATION RATIOS; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; LOWER BOUNDS; THEORY;

LOCATION;

APPROXIMATION ALGORITHMS;

EID: 79960012691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22012-8_5     Document Type: Conference Paper

References (12)

1. Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 29-43. Springer, Heidelberg (2007)
2. Byrka, J., Ghodsi, M., Srinivasan, A.: Lp-rounding algorithms for facility-location problems. in arxiv1007.3611 (2010)
3. Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 378-388 (1999)
4. Chudak, F.A., Shmoys, D.B.: Improved approximation algorithms for the uncapacitated facility location problem. SIAM J. Comput. 33(1), 1-25 (2004)
5. Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 649-657 (1998)
6. Hochbaum, D.S.: Heuristics for the fixed cost median problem. Mathematical Programming 22, 148-162 (1982)
7. Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. J. ACM 50, 795-824 (2003), http://doi.acm.org/10.1145/950620.950621
8. Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the Thiry-fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pp. 731-740. ACM, New York (2002), http://doi.acm.org/10.1145/509907.510012
9. Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, Philadelphia, PA, USA, pp. 1-10 (1998), http://portal.acm.org/citation.cfm?id=314613.314616
10. Lin, J., Vitter, J.S.: Approximation algorithms for geometric median problems. Inf. Process. Lett. 44, 245-249 (1992), http://portal.acm.org/ citation.cfm?id=152566.152569
11. Mahdian, M., Ye, Y., Zhang, J.: Approximation algorithms for metric facility location problems. SIAM J. Comput. 36(2), 411-432 (2006)
12. Shmoys, D.B., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems (extended abstract). In: STOC 1997: Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp. 265-274. ACM, New York (1997)