Approximation algorithms for metric facility location problems

SIAM Journal on Computing

Volumn 36, Issue 2, 2006, Pages 411-432

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

^a MICROSOFT RESEARCH   (United States)

^b Stanford University   (United States)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Facility location problem; Greedy method; Linear programming

Indexed keywords

FACILITY LOCATION PROBLEMS; GREEDY METHOD; INTEGRALITY GAP; LINEAR PROGRAMMING RELAXATION;

APPROXIMATION THEORY; LINEAR PROGRAMMING; MEASUREMENT THEORY; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

EID: 33847165220     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703435716     Document Type: Article

References (26)

1. A. AGEEV, Y. YE, AND J. ZHANG, Improved combinatorial approximation algorithms for the k-level facility location problem, SIAM J. Discrete Math., 18 (2004), pp. 207-217.
2. V. ARYA, N. GARG, R. KHANDEKAR, A. MEYERSON, K. MUNAGALA, AND V. PANDIT, Local search heuristics for k-median and facility location problems, SIAM J. Comput., 33 (2004), pp. 544-562.
3. P. BAUER AND R. ENDERS, A capacitated facility location problem with integer decision variables, in Proceedings of the International Symposium on Mathematical Programming (ISMP), 1997.
4. 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, New York, 1999, IEEE Press, Piscataway, NJ, pp. 378-388.
5. F. A. CHUDAK AND D. B. SHMOYS, Improved approximation algorithms for the capacitated facility location problem, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 1999, SIAM, Philadelphia, 1999, pp. S875-S876.
6. F. A. CHUDAK AND D. B. SHMOYS, Improved approximation algorithms for the uncapacitated faculty location problem, SIAM J. Comput., 33 (2003), pp. 1-25.
7. G. CORNUEJOLS, G. L. NEMHAUSER, AND L. A. WOLSEY, The uncapacitated facility location problem, in Discrete Location Theory, P. Mirchandani and R. Francis, eds., John Wiley and Sons, New York, 1990, pp. 119-171.
8. S. GUHA AND S. KHULLER, Greedy strikes back: Improved facility location algorithms, J. Algorithms, 31 (1999), pp. 228-248.
9. M. HAJIAGHAYI, M. MAHDIAN, AND V. S. MIRROKNI, The facility location problem with general cost functions, Networks, 42 (2003), pp. 42-47.
10. D. S. HOCHBAUM, Heuristics for the fixed cost median problem, Math. Programming, 22 (1982), pp. 148-162.
11. K. HOLMBERG, Solving the staircase cost facility location problem with decomposition and piecewise linearization, European J. Oper. Res., 74 (1994), pp, 41-61.
12. K. JAIN, M. MAHDIAN, E. MARKAKIS, A. SABERI, AND V. V. VAZIRANI, Approximation algorithms for facility location via dual fitting with factor-revealing LP, J. ACM, 50 (2003), pp. 795-824.
13. K. JAIN, M. MAHDIAN, AND A. SABERI, A new greedy approach for facility location problems, in Proceedings of the 11th Annual European Symposium on Algorithms (ESA), G. Di Battista and U, Zwick, eds., Lecture Notes in Comput. Sci. 2832, Springer, New York, 2003, pp. 409-421.
14. K. JAIN AND V. V. VAZIRANI, Approximation algorithms for metric facility location and kmedian problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 48 (2001), pp. 274-296.
15. M. R. KORUPOLU, C. G. PLAXTON, AND R. RAJARAMAN, Analysis of a local search heuristic for facility location problems, J. Algorithms, 37 (2000), pp. 146-188.
16. 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, Lecture Notes in Comput. Sci. 2129, Springer-Verlag, New York, Berlin, 2001, pp. 127-137.
17. M. MAHDIAN AND M. PAL, Universal facility location, in Proceedings of the 11th Annual European Symposium on Algorithms (ESA), 2003.
18. M. MAHDIAN, Y. YE, AND J. ZHANG, Improved approximation algorithms for metric facility location problems, in Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Comput. Sci. 2462, Springer-Verlag, New York, Berlin, 2002, pp. 229-242.
19. M. MAHDIAN, Y. YE, AND J. ZHANG, A 2-approximation algorithm for the soft-capacitated facility location problem, in Proceedings of 6th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2003), Lecture Notes in Comput. Sci. 2764, Springer-Verlag, New York, Berlin, 2003, pp. 129-140.
20. C. S, REVELL AND G. LAPORTE, The plant location problem: New models and research prospects, Oper. Res., 44 (1996), pp. 864-874.
21. D. B. SHMOYS, Approximation algorithms for facility location problems, in Approximation Algorithms for Combinatorial Optimization, K. Jansen and S. Khuller, eds., Lecture Notes in Comput. Sci. 1913, Springer, Berlin, 2000, pp. 27-33.
22. 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, El Paso, TX, 1997, ACM, New York, 1997, pp. 265-274.
23. M. SVIRIDENKO, An improved approximation algorithm for the metric incapacitated facility location problem, in Integer Programming and Combinatorial Optimization: 9th International IPCO Conference, Cambridge, MA, 2002, W. J. Cook and A. S. Schulz, eds., Lecture Notes in Comput. Sei. 2337, Springer, New York, 2002, pp. 240-257.
24. M. THORUP, Quick and good facility location, in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 2003, SIAM, Philadelphia, 2003, pp. 178-185.
25. M. THORUP, Quick k-median, k-center, and facility location for sparse graphs, SIAM J. Comput., 34 (2005), pp. 405-432.
26. J. ZHANG, Approximating the two-level facility location problem via a quasi-greedy approach, Math. Programming, 108 (2006), pp. 159-176.