Analysis of a Local Search Heuristic for Facility Location Problems

Journal of Algorithms

Volumn 37, Issue 1, 2000, Pages 146-188

  Korupolu, Madhukar R ^a   Plaxton, C Greg ^a   Rajaraman, Rajmohan ^b,c  

^a University of Texas at Austin   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038425786     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1100     Document Type: Article

References (28)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, "Network Flows: Theory, Algorithms, and Applications," Prentice-Hall, Upper Saddle River, NJ, 1993.
2. S. Arora, P. Raghavan, and S. Rao, Approximation schemes for Euclidean k-medians and related problems, in "Proceedings of the 30th Annual ACM Symposium on Theory of Computing," pp. 106-113, May 1998.
3. M. Charikar and S. Guha, 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, October 1999.
4. M. Charikar, S. Guha, D. Shmoys, and É. Tardos, A constant-factor approximation algorithm for the k-median problem, in "Proceedings of the 31st Annual ACM Symposium on Theory of Computing," pp. 1-10, May 1999.
5. F. A. Chudak, Improved approximation algorithms for the uncapacitated facility location problem, in "Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization," pp. 180-194, June 1998.
6. F. A. Chudak and D. Shmoys, Improved approximation algorithms for a capacitated facility location problem, in "Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 875-876, January 1999.
7. F. A. Chudak and D. Williamson, Improved approximation algorithms for capacitated facility location problems, in "Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, pp. 99-113, June 1999.
8. G. Corneújols, G. L. Nemhauser, and L. A. Wolsey, The uncapacitated facility location problem, in "Discrete Location Theory" (P. Mirchandani and R. Francis, Eds.), pp. 119-171, Wiley, New York, 1990.
9. G. Diehr, "An Algorithm for the p-Median Problem," Technical Report 191, Western Management Science Institute, UCLA, June 1972.
10. N. Garg and J. Könemann, Faster and simpler algorithms for multicommodity flow and other traditional packing problems, in "Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science," pp. 300-309, October 1998.
11. S. Guha and S. Khuller, Greedy strikes back: Improved facility location algorithms, in "Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 649-657, January 1998. [To appear in J. Algorithms]
12. D. S. Hochbaum, Heuristics for the fixed cost median problem, Math. Programming 22 (1982), 148-162.
13. D. S. Hochbaum, Various notions of approximations: Good, better, best, and more, in "Approximation Algorithms for NP-hard Problems" (D. S. Hochbaum, Ed.), pp. 346-398, PWS, Boston, 1995.
14. K. Jain and V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, in "Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science," pp. 1-10, October 1999.
15. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984), 373-395.
16. L. G. Khachiyan, A polynomial algorithm for linear programming, Soviet Math. Dokl. 20 (1979), 191-194.
17. M. 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," pp. 1-10, January 1998.
18. A. A. Kuehn and M. J. Hamburger, A heuristic program for locating warehouses, Management Sci. 9 (1963), 643-666.
19. J.-H. Lin and J. S. Vitter, Approximation algorithms for geometric median problems, Inform. Process. Lett. 44 (1992), 245-249.
20. J.-H. Lin and J. S. Vitter, ε-Approximations with minimum packing constraint violations, in "Proceedings of the 24th Annual ACM Symposium on Theory of Computing," pp. 771-782, May 1992.
21. R. F. Love, J. G. Morris, and G. O. Wesolowsky, "Facilities Location: Models and Methods," North-Holland, New York, 1988.
22. P. Mirchandani and R. Francis, "Discrete Location Theory," Wiley, New York, 1990.
23. D. B. Shmoys and É. Tardos, An approximation algorithm for the generalized assignment problem, Math. Programming 62 (1993), 461-474.
24. D. B. Shmoys, É. Tardos, and K. Aardal, Approximation algorithms for facility location problems, in "Proceedings of the 29th Annual ACM Symposium on Theory of Computing," pp. 265-274, May 1997.
25. M. Sviridenko, Personal communication, December 1999.
26. M. B. Teitz and P. Bart, Heuristic methods for estimating the generalized vertex median of a weighted graph, Oper. Res. 16 (1968), 955-961.
27. N. Young, Randomized rounding without solving the linear program, in "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms," pp. 170-178, January 1995.
28. N. Young, "Greedy Approximation Algorithms for k-medians by Randomized Rounding," Technical Report PCS-TR99-344, Department of Computer Science, Dartmouth College, March 1999.