Abstract
This work gives new insight into two well-known approximation algorithms for the uncapacitated facility location problem: the primal-dual algorithm of Jain & Vazirani, and an algorithm of Mettu & Plaxton. Our main result answers positively a question posed by Jain & Vazirani of whether their algorithm can be modified to attain a desired “continuity” property. This yields an upper bound of 3 on the integrality gap of the natural LP relaxation of the k-median problem, but our approach does not yield a polynomial time algorithm with this guarantee. We also give a new simple proof of the performance guarantee of the Mettu-Plaxton algorithm using LP duality, which suggests a minor modification of the algorithm that makes it Lagrangian-multiplier preserving.
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.
Similar content being viewed by others
References
Ageev, A., Sviridenko, M.: An approximation algorithm for the uncapacitated facility location problem (manuscript) (1997)
Arora, S., Bollobas, B., Lovász, L.: Proving integrality gaps without knowing the linear program. In: 43rd FOCS, pp. 313–322 (2002)
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristic for k-median and facility location problems. In: 33rd STOC, pp. 21–29 (2001)
Balinski, M.: On finding integer solutions to linear programs. In: Proc. IBM Scientific Computing Symp. on Combinatorial Problems, pp. 225–248 (1966)
Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: 30th STOC, pp. 161–168 (1998)
Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: 37th FOCS, pp. 184–193 (1996)
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: 40th FOCS, pp. 378–388 (1999)
Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: 31st STOC, pp. 1–10 (1999)
Chudak, F., Shmoys, D.B.: Improved approximation algorithms for uncapacitated facility location. SIAM J. Comput. (to appear)
Chudak, F., Roughgarden, T., Williamson, D.P.: Approximate k-mSTs and k-steiner trees via the primal-dual method and lagrangean relaxation. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 60–70. Springer, Heidelberg (2001)
Goemans, M., Williamson, D.P.: A general approximation technique for constrained forest problems. SICOMP 24, 296–317 (1995)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Alg. 31, 228–248 (1999)
Hochbaum, D.: Heuristics for the fixed cost median problem. Math. Prog. 22, 148–162 (1982)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. To appear in JACM
Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using primal-dual schema and Lagrangian relaxation. JACM 48, 274–296 (2001)
Jain, K., Vazirani, V.: Primal-dual approximation algorithms for metric facility location and k-median problems. In: 40th FOCS, pp. 2–13 (1999)
Korupolu, M., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. J. Alg. 37, 146–188 (2000)
Lin, J.H., Vitter, J.: Approximation algorithms for geometric median problems. IPL 44, 245–249 (1992)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002)
Meggido, N.: Combinatorial optimization with rational objective functions. Math. OR 4, 414–424 (1979)
Mettu, R., Plaxton, C.G.: The online median problem. In: 41st FOCS, pp. 339–348 (2000)
Pál, M., Tardos, É.: Strategy proof mechanisms via primal-dual algorithms. To appear in 44th FOCS (2003)
Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: 29th STOC, pp. 265–274 (1997)
Sviridenko, M.: An improved approximation algorithm for the metric uncapacitated facility location problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 240–257. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Archer, A., Rajagopalan, R., Shmoys, D.B. (2003). Lagrangian Relaxation for the k-Median Problem: New Insights and Continuity Properties. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive