A new approximation algorithm for the k-facility location problem

Theoretical Computer Science

Volumn 384, Issue 1, 2007, Pages 126-135

  Zhang, Peng ^a,b  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

Approximation algorithm; Facility location; k Median; Local search

Indexed keywords

COMPUTER SCIENCE; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATION RATIOS; DUAL FITTING; FACILITY LOCATION; LOCAL SEARCH;

APPROXIMATION ALGORITHMS;

EID: 34548204977     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.05.024     Document Type: Article

References (16)

1. Arya V., Garg N., Khandekar R., Meyerson A., Munagala K., and Pandit V. Local search heuristic for k-median and facility location problem. SIAM Journal on Computing 33 (2004) 544-562
2. J. Beasley, Operations research library, 2005. Available at http://people.brunel.ac.uk/~mastjjb/jeb/orlib/uncapinfo.html
3. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, in: Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science, 1999, pp. 378-388
4. Guha S., and Khuller S. Greedy strikes back: improved facility location algorithms. Journal of Algorithms 31 (1999) 228-248
5. S. Guha, A. Meyerson, K. Munagala, Hierarchical placement and network design problems, in: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 603-612
6. Hajiaghayi M., Mahdian M., and Mirrokni V. The facility location problem with general cost functions. Networks 42 (2003) 42-47
7. Jain K., Mahdian M., Markakis E., Saberi A., and Vazirani V. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50 (2003) 795-824
8. K. Jain, M. Mahdian, A. Saberi, A new greedy approach for facility location, in: Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, pp. 731-740
9. Jain K., and Vazirani V. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM 48 (2001) 274-296
10. Korupolu M., Plaxton C., and Rajaraman R. Analysis of a local search heuristic for facility location problems. Journal of Algorithms 37 (2000) 146-188
11. Love R., Morris J., and Wesolowsky G. Facilities Location: Models and Methods (1988), North-Holland, New York
12. In: Mirchandani P., and Francis R. (Eds). Discrete Location Theory (1990), John Wiley and Sons, New York
13. Mahdian M., Markakis E., Saberi A., and Vazirani V. A greedy facility location algorithms analyzed using dual fitting. Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, in: Lecture Notes in Computer Science vol. 2129 (2001), Springer, Berlin 127-137
14. M. Mahdian, Y. Ye, J. Zhang, Improved approximation algorithms for metric facility location problems, in: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, pp. 229-242
15. L. Qiu, V. Padmanabhan, G. Voelker, On the placement of web server replicas, in: Proceedings of IEEE INFOCOM'01, 2001, pp. 1587-1596
16. Shmoys D. Approximation algorithms for facility location problems. Proceedings of the 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization, in: Lecture Notes in Computer Science vol. 1913 (2000), Springer, Berlin 27-33