Abstract
This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that \(t_{j}\) distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
Enquiries about data availability should be directed to the authors.
References
An H, Singh M, Svensson O (2017) LP-based algorithms for capacitated facility location. SIAM J Comput 46(1):272–306
Byrka J, Aardal K (2010) An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. SIAM J Comput 39(6):2212–2231
Byrka J, Srinivasan A, Swamy C (2010) Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. In: Integer programming and combinatorial optimization, 14th International Conference, Lecture Notes in Computer Science, vol 6080. Springer, pp 244–257
Chakrabarty D, Negahbani M (2023) Robust k-center with two types of radii. Math Program 197(2):991–1007
Charikar M, Guha S (1999) Improved combinatorial algorithms for the facility location and k-median problems. In: 40th Annual symposium on foundations of computer science. IEEE Computer Society, pp 378–388
Chudak FA, Nagano K (2007) Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 79–88
Chudak FA, Shmoys DB (2003) Improved approximation algorithms for the uncapacitated facility location problem. SIAM J Comput 33(1):1–25
Cohen-Addad V, Grandoni F, Lee E, Schwiegelshohn C (2023) Breaching the 2 LMP approximation barrier for facility location with applications to k-median. In: Proceedings of the 2023 ACM-SIAM symposium on discrete algorithms, SODA. SIAM, pp 940–986
Du D, Lu R, Xu D (2012) A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63(1–2):191–200
Fujishige S (2005) Submodular functions and optimization. In: Annals of Discrete Mathematics, vol 58, 2nd edn. Elsevier, Amsterdam
Guha S, Meyerson A, Munagala K (2003) A constant factor approximation algorithm for the fault-tolerant facility location problem. J Algorithms 48(2):429–440
Hayrapetyan A, Swamy C, Tardos É (2005) Network design for information networks. In: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, 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(2):274–296
Jain K, Vazirani VV (2004) An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica 38(3):433–439
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(6):795–824
Kamiyama N (2013) The fault-tolerant facility location problem with submodular penalties. In: MI preprint series, pp 1–15
Korupolu MR, Plaxton CG, Rajaraman R (1998) Analysis of a local search heuristic for facility location problems. In: Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms. ACM/SIAM, pp 1–10
Li S (2013) A 1.488 approximation algorithm for the uncapacitated facility location problem. Inf Comput 222:45–58
Li Y, Du D, Xiu N, Xu D (2015) Improved approximation algorithms for the facility location problems with linear/submodular penalties. Algorithmica 73(2):460–482
Lin J, Vitter JS (1992) Approximation algorithms for geometric median problems. Inf Process Lett 44(5):245–249
Mahdian M, Ye Y, Zhang J (2006) Approximation algorithms for metric facility location problems. SIAM J Comput 36(2):411–432
Shmoys DB, Tardos É, Aardal K (1997) Approximation algorithms for facility location problems (extended abstract). In: Proceedings of the twenty-ninth annual ACM symposium on the theory of computing. ACM, pp 265–274
Sviridenko M (2002) An improved approximation algorithm for the metric uncapacitated facility location problem. In: Integer programming and combinatorial optimization, 9th International IPCO conference. Springer, pp 240–257
Swamy C, Shmoys DB (2008) Fault-tolerant facility location. ACM Trans Algorithms 4(4):51:1-51:27
Williamson DP, Shmoys DB (2010) The design of approximation algorithms. Cambridge University Press, Cambridge
Funding
This work is supported by National Natural Science Foundation of China (No. 12071126).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The research is supported by National Nature Science Foundation of China (No. 12071126).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Guo, Y., Li, Q. Approximation algorithms for the fault-tolerant facility location problem with submodular penalties. J Comb Optim 47, 14 (2024). https://doi.org/10.1007/s10878-024-01106-0
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01106-0