A greedy facility location algorithm analyzed using dual fitting

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

Volumn 2129, Issue , 2015, Pages 127-137

  Mahdian, Mohammad ^a   Markakis, Evangelos ^b   Saberi, Amin ^b   Vazirani, Vijay ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; LOCATION; OPTIMIZATION; RANDOM PROCESSES;

APPROXIMATION RATIOS; COMPLETE BIPARTITE GRAPHS; CONCAVE-COST VERSION; FACILITY LOCATIONS; FAULT-TOLERANT; RUNNING TIME;

APPROXIMATION ALGORITHMS;

EID: 84923069774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Charikar and S. Guha. Improved combinatorial algorithms for facility location and k-median problems. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 378-388, October 1999.
2. M. Charikar, S. Khuller, D. Mount, and G. Narasimhan. Algorithms for Facility Location Problems with Outliers. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
3. F. Chudak and D. Shmoys. Improved approximation algorithms for the capacitated facility location problem. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875-876, 1999.
4. V. Chvatal. A greedy heuristic for the set covering problem. Math. Oper. Res. 4, pp. 233-235, 1979.
5. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms 31, pp. 228-248, 1999.
6. S. Guha, A. Meyerson, and K. Munagala. Improved Approximation Algorithms for Fault-tolerant Facility Location. Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001.
7. D. S. Hochbaum. Heuristics for the fixed cost median problem. Math. Programming 22, 148-162, 1982.
8. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems, manuscript.
9. K. Jain and V. V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 2-13, October 1999.
10. K. Jain and V. Vazirani. An approximation algorithm for the fault tolerant metric facility location problem. Proceedings of APPROX 2000, pp. 177-183, 2000.
11. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1-10, January 1998.
12. A. A. Kuehn and M. J. Hamburger. A heuristic program for locating warehouses. Management Science 9, pp. 643-666, 1963.
13. L. Lovasz. On the ratio of Optimal Integral and Fractional Covers. Discrete Math. 13, pp. 383-390, 1975.
14. R. Mettu and G. Plaxton. The online median problem. Proceedings of 41st IEEE FOCS, 2000.
15. S. Rajagopalan and V. V. Vazirani. Primal-dual RNC approximation of covering integer programs. SIAM J. Comput. 28, pp. 526-541, 1999.
16. D. B. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265-274, May1997.
17. M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. To appear in ICALP 2001.
18. V. V. Vazirani. Approximation Algorithms, Springer-Verlag, Berlin, 2001.