Abstract
The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + \(\sqrt{3} + \epsilon\)-approximation algorithm using the local search approach, which significantly improves the previously known approximation ratio 4, given by Jain et al. using the greedy method (J. ACM 50 (2003) 795–824).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problem. SIAM J. Comput. 33, 544–562 (2004)
Beasley, J.: Operations research library (2005), Available at http://people.brunel.ac.uk/~mastjjb/jeb/orlib/uncapinfo.html
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science, pp. 378–388 (1999)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31, 228–248 (1999)
Hajiaghayi, M., Mahdian, M., Mirrokni, V.: The facility location problem with general cost functions. Networks 42, 42–47 (2003)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50, 795–824 (2003)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location. In: Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 731–740 (2002)
Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k median problems using the primal-dual schema and lagrangian relaxation. J. ACM 48, 274–296 (2001)
Korupolu, M., Plaxton, C., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Algorithms 37, 146–188 (2000)
Love, R., Morris, J., Wesolowsky, G.: Facilities location: models and methods. North Holland, New York (1988)
Mirchandani, P., Francis, R. (eds.): Discrete location theory. John Wiley and Sons, New York (1990)
Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: A greedy facility location algorithms analyzed using dual fitting. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 127–137. Springer, Heidelberg (2001)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 229–242 (2002)
Shmoys, D.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–33. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, P. (2006). A New Approximation Algorithm for the k-Facility Location Problem. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_21
Download citation
DOI: https://doi.org/10.1007/11750321_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)