Fault-tolerant k-Supplier with Outliers

Authors Deeparnab Chakrabarty, Luc Cote , Ankita Sarkar

Thumbnail PDF


  • Filesize: 0.91 MB
  • 19 pages

Document Identifiers

Author Details

Deeparnab Chakrabarty
  • Department of Computer Science, Dartmouth College, Hanover, NH, USA
Luc Cote
  • Thayer School of Engineering, Dartmouth College, Hanover, NH, USA
Ankita Sarkar
  • Department of Computer Science, Dartmouth College, Hanover, NH, USA

Cite AsGet BibTex

Deeparnab Chakrabarty, Luc Cote, and Ankita Sarkar. Fault-tolerant k-Supplier with Outliers. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 23:1-23:19, Schloss Dagstuhl โ€“ Leibniz-Zentrum fรผr Informatik (2024)


We present approximation algorithms for the Fault-tolerant k-Supplier with Outliers (FkSO) problem. This is a common generalization of two known problems - k-Supplier with Outliers, and Fault-tolerant k-Supplier - each of which generalize the well-known k-Supplier problem. In the k-Supplier problem the goal is to serve n clients C, by opening k facilities from a set of possible facilities F; the objective function is the farthest that any client must travel to access an open facility. In FkSO, each client v has a fault-tolerance ๐“_v, and now desires ๐“_v facilities to serve it; so each client vโ€™s contribution to the objective function is now its distance to the ๐“_v^th closest open facility. Furthermore, we are allowed to choose m clients that we will serve, and only those clients contribute to the objective function, while the remaining n-m are considered outliers. Our main result is a (4t-1)-approximation for the FkSO problem, where t is the number of distinct values of ๐“_v that appear in the instance. At t = 1, i.e. in the case where the ๐“_vโ€™s are uniformly some ๐“, this yields a 3-approximation, improving upon the 11-approximation given for the uniform case by Inamdar and Varadarajan [2020], who also introduced the problem. Our result for the uniform case matches tight 3-approximations that exist for k-Supplier, k-Supplier with Outliers, and Fault-tolerant k-Supplier. Our key technical contribution is an application of the round-or-cut schema to FkSO. Guided by an LP relaxation, we reduce to a simpler optimization problem, which we can solve to obtain distance bounds for the "round" step, and valid inequalities for the "cut" step. By varying how we reduce to the simpler problem, we get varying distance bounds - we include a variant that gives a (2^t + 1)-approximation, which is better for t โˆˆ {2,3}. In addition, for t = 1, we give a more straightforward application of round-or-cut, yielding a 3-approximation that is much simpler than our general algorithm.

Subject Classification

ACM Subject Classification
  • Theory of computation โ†’ Facility location and clustering
  • Clustering
  • approximation algorithms
  • round-or-cut


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Ravinder Ahuja, Aakarsha Chug, Shaurya Gupta, Pratyush Ahuja, and Shruti Kohli. Classification and clustering algorithms of machine learning with their applications. Nature-inspired computation in data mining and machine learning, pages 225-248, 2020. URL: https://doi.org/10.1007/978-3-030-28553-1_11.
  2. Hyung-Chan An, Mohit Singh, and Ola Svensson. LP-Based Algorithms for Capacitated Facility Location. In Proc., IEEE Symposium on Foundations of Computer Science (FOCS), 2014. URL: https://doi.org/10.1137/151002320.
  3. Georg Anegg, Haris Angelidakis, Adam Kurpisz, and Rico Zenklusen. A technique for obtaining true approximations for k-center with covering constraints. Math. Programming, pages 1-25, 2022. URL: https://doi.org/10.1007/s10107-021-01645-y.
  4. Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, and Maryam Negahbani. Revisiting Priority k-Center: Fairness and Outliers. In Proc., International Colloquium on Automata, Languages and Programming (ICALP), pages 21:1-21:20, 2021. URL: https://doi.org/10.4230/LIPIcs.ICALP.2021.21.
  5. Jaroslaw Byrka, Aravind Srinivasan, and Chaitanya Swamy. Fault-tolerant facility location: a randomized dependent LP-rounding algorithm. In Proc., MPS Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 244-257, 2010. URL: https://doi.org/10.1007/978-3-642-13036-6.
  6. Deeparnab Chakrabarty, Prachi Goyal, and Ravishankar Krishnaswamy. The Non-Uniform k-Center Problem. ACM Trans. on Algorithms (TALG), 2020. Preliminary version in ICALP 2016. URL: https://doi.org/10.1145/3392720.
  7. Deeparnab Chakrabarty and Maryam Negahbani. Generalized Center Problems with Outliers. ACM Trans. on Algorithms (TALG), 2019. Prelim. version in ICALP 2018. URL: https://doi.org/10.1145/3338513.
  8. Deeparnab Chakrabarty and Maryam Negahbani. Robust k-center with two types of radii. Math. Programming, 197(2):991-1007, 2023. Special Issue for Proc. IPCO 2021. URL: https://doi.org/10.1007/s10107-022-01799-3.
  9. Deeparnab Chakrabarty, Maryam Negahbani, and Ankita Sarkar. Approximation Algorithms for Continuous Clustering and Facility Location Problems. In Proc., European Symposium on Algorithms, pages 33:1-33:15, 2022. URL: https://doi.org/10.4230/LIPIcs.ESA.2022.33.
  10. Moses Charikar, Samir Khuller, David M. Mount, and Giri Narasimhan. Algorithms for Facility Location Problems with Outliers. In Proc., ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 642-651, 2001. URL: https://dl.acm.org/doi/abs/10.5555/365411.365555.
  11. Shiva Chaudhuri, Naveen Garg, and Ramamoorthi Ravi. The p-neighbor k-center problem. Inform. Process. Lett., 65(3):131-134, 1998. URL: https://doi.org/10.1016/S0020-0190(97)00224-X.
  12. Shiri Chechik and David Peleg. Robust fault tolerant uncapacitated facility location. Theoretical Computer Science, 543:9-23, 2014. Preliminary version appeared in STACS 2010. URL: https://doi.org/10.1016/j.tcs.2014.05.013.
  13. Vasek Chvรกtal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4(4):305-337, 1973. URL: https://doi.org/10.1016/0012-365X(73)90167-2.
  14. Shichuan Deng. Fault-Tolerant Center Problems with Robustness and Fairness. CoRR, abs/2011.00817v2, 2020. Citation specific to version 2; latest version is a significantly different work. URL: https://arxiv.org/abs/2011.00817v2.
  15. Shichuan Deng. Constant approximation for fault-tolerant median problems via iterative rounding. Operations Research Letters, 50(4):384-390, 2022. URL: https://doi.org/10.1016/j.orl.2022.05.002.
  16. Ralph E Gomory. Some polyhedra related to combinatorial problems. Linear Algebra Appl., 2(4):451-558, 1969. URL: https://doi.org/10.1016/0024-3795(69)90017-2.
  17. Sudipto Guha, Adam Meyerson, and Kamesh Munagala. A constant factor approximation algorithm for the fault-tolerant facility location problem. Journal of Algorithms, 48(2):429-440, 2003. Preliminary version appeared in SODA 2001. URL: https://doi.org/10.1016/S0196-6774(03)00056-7.
  18. MohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, and Barna Saha. A constant factor approximation algorithm for fault-tolerant k-median. ACM Trans. on Algorithms (TALG), 12(3):1-19, 2016. URL: https://doi.org/10.1145/2854153.
  19. Dorit S. Hochbaum and David B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM, 33(3):533-550, 1986. URL: https://doi.org/10.1145/5925.5933.
  20. Tanmay Inamdar and Kasturi Varadarajan. Fault tolerant clustering with outliers. In Proc., Workshop on Approximation and Online Algorithms (WAOA), pages 188-201. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-39479-0_13.
  21. Anil K Jain, M Narasimha Murty, and Patrick J Flynn. Data clustering: a review. ACM computing surveys (CSUR), 31(3):264-323, 1999. URL: https://doi.org/10.1145/331499.331504.
  22. Kamal Jain and Vijay V Vazirani. An approximation algorithm for the fault tolerant metric facility location problem. Algorithmica, 38:433-439, 2004. Preliminary version appeared in APPROX 2000. URL: https://doi.org/10.1007/s00453-003-1070-1.
  23. Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, and Ola Svensson. Towards Non-Uniform k-Center with Constant Types of Radii. In Symposium on Simplicity in Algorithms (SOSA), pages 228-237. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977066.16.
  24. Christopher Jung, Sampath Kannan, and Neil Lutz. Service in Your Neighborhood: Fairness in Center Location. In Proceedings, Foundations of Responsible Computing, FORC 2020, volume 156, pages 5:1-5:15, 2020. URL: https://doi.org/10.4230/LIPIcs.FORC.2020.5.
  25. Samir Khuller, Robert Pless, and Yoram J Sussmann. Fault tolerant k-center problems. Theoretical Computer Science, 242(1-2):237-245, 2000. URL: https://doi.org/10.1016/S0304-3975(98)00222-9.
  26. Sven Oliver Krumke. On a generalization of the p-center problem. Inform. Process. Lett., 56(2):67-71, 1995. URL: https://doi.org/10.1016/0020-0190(95)00141-X.
  27. Nirman Kumar and Benjamin Raichel. Fault Tolerant Clustering Revisited. In Canadian Conference on Computational Geometry (CCCG), 2013. URL: https://doi.org/10.48550/arXiv.1307.2520.
  28. Richard CT Lee. Clustering analysis and its applications. In Advances in Information Systems Science: Volume 8, pages 169-292. Springer, 1981. URL: https://doi.org/10.1007/978-1-4613-9883-7_4.
  29. Yu Li, Dachuan Xu, Donglei Du, and Naihua Xiu. Improved approximation algorithms for the robust fault-tolerant facility location problem. Inform. Process. Lett., 112(10):361-364, 2012. URL: https://doi.org/10.1016/j.ipl.2012.02.004.
  30. Chiun-Ming Liu. Clustering techniques for stock location and order-picking in a distribution center. Comput. Oper. Res., 26(10-11):989-1002, 1999. URL: https://doi.org/10.1016/S0305-0548(99)00026-X.
  31. Sepideh Mahabadi and Ali Vakilian. (Individual) Fairness for k-Clustering. In Proc., International Conference on Machine Learning (ICML), pages 7925-7935, 2020. URL: https://dl.acm.org/doi/abs/10.5555/3524938.3525549.
  32. Boris Mirkin. Mathematical classification and clustering, volume 11. Springer Science & Business Media, 1996. URL: https://doi.org/10.1007/978-1-4613-0457-9.
  33. Jรกn Plesnรญk. A heuristic for the p-center problems in graphs. Discrete Applied Mathematics, 17(3):263-268, 1987. URL: https://doi.org/10.1016/0166-218X(87)90029-1.
  34. Bartosz Rybicki and Jaroslaw Byrka. Improved approximation algorithm for fault-tolerant facility placement. In Proc., Workshop on Approximation and Online Algorithms (WAOA), pages 59-70. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-18263-6_6.
  35. Chinmay Sonar, Subhash Suri, and Jie Xue. Fault Tolerance in Euclidean Committee Selection. In Inge Li Gรธrtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA 2023), volume 274 of Leibniz International Proceedings in Informatics (LIPIcs), pages 95:1-95:14, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum fรผr Informatik. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.95.
  36. Chaitanya Swamy and David B. Shmoys. Fault-Tolerant Facility Location. ACM Trans. on Algorithms (TALG), 4(4), August 2008. URL: https://doi.org/10.1145/1383369.1383382.
  37. Shihong Xu and Hong Shen. The fault-tolerant facility allocation problem. In Proc., Int. Symposium on Algorithms and Computation (ISAAC), pages 689-698. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-10631-6_70.
  38. Li Yan and Marek Chrobak. Approximation algorithms for the fault-tolerant facility placement problem. Inform. Process. Lett., 111(11):545-549, 2011. URL: https://doi.org/10.1016/j.ipl.2011.03.005.
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail