A 2-approximation algorithm for the soft-capacitated facility location problem

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

Volumn 2764, Issue , 2003, Pages 129-140

  Mahdian, Mohammad ^a   Ye, Yinyu ^b   Zhang, Jiawei ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; FACTOR ANALYSIS; LOCATION; OPTIMIZATION;

APPROXIMATION FACTOR; CAPACITATED FACILITY LOCATION PROBLEMS; FACILITY LOCATION PROBLEM; INTEGRALITY GAPS; LP RELAXATION; QUASI-LINEAR TIME; RUNNING TIME; UNCAPACITATED FACILITY LOCATIONS;

APPROXIMATION ALGORITHMS;

EID: 35248894880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_12     Document Type: Article

References (21)

1. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. In Proceedings of 33rd ACM Symposium on Theory of Computing, 2001.
2. P. Bauer and R. Enders. A capacitated facility location problem with integer decision variables. In International Symposium on Mathematical Programming (ISMP), 1997.
3. M. Charikar and S. Guha. Improved combinatorial algorithms for facility location and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 378-388, October 1999.
4. F.A. Chudak. Improved approximation algorithms for uncapacited facility location. In R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado, editors, Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, pages 180-194. Springer, Berlin, 1998.
5. F.A. Chudak and D. Shmoys. Improved approximation algorithms for the uncapacitated facility location problem, unpublished manuscript, 1998.
6. F.A. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875-876, 1999.
7. G. Cornuejols, G.L. Nemhauser, and L.A. Wolsey. The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119-171. John Wiley and Sons Inc., 1990.
8. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31:228-248, 1999.
9. M. Hajiaghayi, M. Mahdian, and V.S. Mirrokni. The facility location problem with general cost functions. Networks, 42(1):42-47, August 2003.
10. K. Holmberg. Solving the staircase cost facility location problem with decomposition and piecewise linearization. European Journal of Operational Research, 74:41-61, 1994.
11. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani. Approximation algorithms for facility location via dual fitting with factor-revealing LP. to appear in Journal of the ACM, 2002.
12. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In Proceedings of the 34st Annual ACM Symposium on Theory of Computing, 2002.
13. K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM, 48:274-296, 2001.
14. M.R. Korupolu, C.G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, January 1998.
15. M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, volume 2129 of Lecture Notes in Computer Science, pages 127-137. Springer-Verlag, 2001.
16. M. Mahdian, Y. Ye, and J. Zhang. Improved approximation algorithms for metric facility location problems. In Proceedings of 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), 2002.
17. D.B. Shmoys. Approximation algorithms for facility location problems. In K. Jansen and S. Khuller, editors, Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 27-33. Springer, Berlin, 2000.
18. D.B. Shmoys, E. Tardos, and K.I. Aardal. Approximation algorithms for facility location problems. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 265-274, 1997.
19. M. Sviridenko. An 1.582-approximation algorithm for the metric uncapacitated facility location problem. In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, 2002.
20. M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. In Automata, Languages and Programming, 28th International Colloquium, Crete, Greece, volume 2076 of Lecture Notes in Computer Science, pages 249-260, 2001.
21. M. Thorup. Quick and good facility location. In Proceedings of the 14th ACM-SIAM symposium on Discrete Algorithms, 2003.