Abstract
This paper is divided into two parts. In the first part of this paper, we present a 2-approximation algorithm for the soft-capacitated facility location problem. This achieves the integrality gap of the natural LP relaxation of the problem. The algorithm is based on an improved analysis of an algorithm for the linear facility location problem, and a bifactor approximate-reduction from this problem to the soft-capacitated facility location problem. We will define and use the concept of bifactor approximate reductions to improve the approximation factor of several other variants of the facility location problem. In the second part of the paper, we present an alternative analysis of the authors’ 1.52-approximation algorithm for the uncapacitated facility location problem, using a single factor-revealing LP. This answers an open question of [16]Furthermore, this analysis, combined with a recent result of Thorup [21] shows that our algorithm can be implemented in quasi-linear time, achieving the best known approximation factor in the best possible running time.
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 heuristics for k-median and facility location problems. In: Proceedings of 33rd ACM Symposium on Theory of Computing (2001)
Bauer, P., Enders, R.: A capacitated facility location problem with integer decision variables. In: International Symposium on Mathematical Programming, ISMP (1997)
Charikar, M., Guha, S.: Improved combinatorial algorithms for facility location and k-median problems. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 378–388 (October 1999)
Chudak, F.A.: Improved approximation algorithms for uncapacited facility location. In: Bixby, R.E., Boyd, E.A., RĂos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol. 1412, pp. 180–194. Springer, Heidelberg (1998)
Chudak, F.A., Shmoys, D.: Improved approximation algorithms for the uncapacitated facility location problem (1998) (unpublished manuscript)
Chudak, F.A., Shmoys, D.: Improved approximation algorithms for the capacitated facility location problem. In: Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875–876 (1999)
Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119–171. John Wiley and Sons Inc., Chichester (1990)
Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms 31, 228–248 (1999)
Hajiaghayi, M., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Networks 42(1), 42–47 (2003)
Holmberg, K.: Solving the staircase cost facility location problem with decomposition and piecewise linearization. European Journal of Operational Research 74, 41–61 (1994)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Approximation algorithms for facility location via dual fitting with factor-revealing LP. To appear in Journal of the ACM (2002)
Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proceedings of the 34st Annual ACM Symposium on Theory of Computing (2002)
Jain, K., Vazirani, V.V.: 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)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Analysis of a local search heuristic for facility location problems. In: Proceedings of the 9th Annual ACM SIAM Symposium on Discrete Algorithms, January 1998, pp. 1–10 (1998)
Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: A greedy facility location algorithm 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: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, p. 229. Springer, Heidelberg (2002)
Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–33. Springer, Heidelberg (2000)
Shmoys, D.B., Tardos, E., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265–274 (1997)
Sviridenko, M.: An 1.582-approximation algorithm for the metric uncapacitated facility location problem. In: Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization (2002)
Thorup, M.: Quick k-median, k-center, and facility location for sparse graphs. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 249–260. Springer, Heidelberg (2001)
Thorup, M.: Quick and good facility location. In: Proceedings of the 14th ACMSIAM symposium on Discrete Algorithms (2003)
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
Mahdian, M., Ye, Y., Zhang, J. (2003). A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-45198-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40770-6
Online ISBN: 978-3-540-45198-3
eBook Packages: Springer Book Archive