Abstract
In this paper, we study two variants of the classical facility location problem, namely, the facility location problem with linear penalties (FLPLP) and the facility location problem with submodular penalties (FLPSP), respectively. We give a unified dual-fitting based approximation algorithm for these two problems, yielding approximation ratios 2 and 3 respectively.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Charikar M, Khuller S, Mount DM, Naraasimban G (2001) Algorithms for facility location problems with outliers. In: Proceedings of SODA, pp 642–651
Chudak FA, Nagano K (2007) Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovasz extension and non-smooth convex optimization. In: Proceedings of SODA, pp 79–88
Du D, Lu R, Xu D (2012) A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63:191–200
Fujishige S (2005) Submodular functions and optimization, 2nd edn. Annals of discrete mathematics, vol 58. Elsevier, Amsterdam
Geunes J, Levi R, Romeijn HE, Shmoys DB (2011) Approximation algorithms for supply chain planning and logistics problems with market choice. Math Program 130:85–106
Hayrapetyan A, Swamy C, Tardös E (2005) Network design for information networks. In: Proceedings of SODA, pp 933–942
Jain K, Vazirani VV (2001) Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J ACM 48:274–296
Jain K, Mahdian M, Markakis E, Saberi A, Vazirani VV (2003) Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J ACM 50:795–824
Li S (2011) A 1.488 approximation algorithm for the uncapacitated facility location problem. In: Proceedings of ICALP, part II, pp 77–88
Mahdian M, Ye Y, Zhang J (2006) Improved approximation algorithms for metric facility location problems. SIAM J Comput 36:411–432
Shmoys DB, Tardös E, Aardal KI (1997) Approximation algorithms for facility location problems (extended abstract). In: Proceedings of STOC, pp 265–274
Thorup M (2003) Quick and good facility location. In: Proceedings of SODA, pp 178–185
Xu G, Xu J (2005) An LP rounding algorithm for approximating uncapacitated facility location problem with penalties. Inf Process Lett 94:119–123
Xu G, Xu J (2008) An improved approximation algorithm for uncapacitated facility location problem with penalties. J Comb Optim 17:424–436
Acknowledgements
The authors would like to thank two anonymous referees for constructive comments that led to a substantial improvement in the presentation of this paper. The research of the second author is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) grant 283103. The third author’s research is supported by the National Basic Research Program of China (No. 2010CB732501). The fourth author’s research is supported by Scientific Research Common Program of Beijing Municipal Commission of Education (No. KM201210005033).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, Y., Du, D., Xiu, N. et al. A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties. J Comb Optim 27, 609–620 (2014). https://doi.org/10.1007/s10878-012-9540-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9540-5