Abstract
In this paper we present a 1.52-approximation algorithm for the uncapacitated metric facility location problem. This algorithm uses an idea of cost scaling, a greedy algorithm of Jain, Mahdian and Saberi, and a greedy augmentation procedure of Charikar, Guha and Khuller. We also present a 2.89-approximation for the capacitated metric facility location problem with soft capacities.
Research supported in part by NSF grants DMI-9908077.
Research supported in part by NSF grants DMI-9908077 through Yinyu Ye.
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
M. Charikar and S. Guha. Improved Combinatorial algorithms for facility location and k-median problems. In Proceeding of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 378–388, 1999.
F.A. Chudak, Improved approximation algorithms for uncapacitated facility location. In R.E. Bixby, E.A. Boyd, and R.Z. RÃos-Mercado, editors, Integer Programming and Combinatorial Optimization, volume 1412 of Lecture Notes in Computer Science, pages 180–194. Springer, Berlin, 1998.
F.A. Chudak and D.B. Shmoys. Improved approximation algorithms for the capacitated facility location problem. In Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 875–876, 1999.
S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31:228–248, 1999.
D.S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22(2):148–162, 1982.
K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems, In Proceedings of STOC 2002.
K. Jain and V.V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation Journal of the ACM, 48:274–296, 2001.
M.R. 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, pages 1–10, 1998.
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, Volume 2129 of Lecture Notes in Compuer Science, page 127–137. Springer-Verlag, 2001.
D.B. Shmoys. Approximation algorithms for facility location problems. In K. Jansen and S. Khuller, editors, Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 27–33. Springer, Berlin, 2000.
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, pages 265–274, 1997.
M. Sviridenko. An improved approximation algorithm for the metric uncapacitated facility location problem. In W.J. Cook and A.S. Schulz, editors, Integer Programming and Combinatorial Optimization, volume 2337 of Lecture Notes in Computer Science, pages 240–257. Springer, Berlin, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahdian, M., Ye, Y., Zhang, J. (2002). Improved Approximation Algorithms for Metric Facility Location Problems. In: Jansen, K., Leonardi, S., Vazirani, V. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2002. Lecture Notes in Computer Science, vol 2462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45753-4_20
Download citation
DOI: https://doi.org/10.1007/3-540-45753-4_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44186-1
Online ISBN: 978-3-540-45753-4
eBook Packages: Springer Book Archive