Author:
Chakrabarty Deeparnab,Negahbani Maryam
Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference24 articles.
1. Adjiashvili, D., Baggio, A., Zenklusen, R.: Firefighting on trees beyond integrality gaps. ACM Trans. Algorithms (TALG) 15(2), 20 (2018)
2. An, H., Singh, M., Svensson, O.: LP-based algorithms for capacitated facility location. SIAM J. Comput. (SICOMP) 46(1), 272–306 (2017)
3. Anegg, G., Angelidakis, H., Kurpisz, A., Zenklusen, R.: A technique for obtaining true approximations for $$k$$-center with covering constraints. In: Proceedings, MPS Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 52–65 (2020)
4. Angelidakis, H., Makarychev, K., Makarychev, Y.: Algorithms for stable and perturbation-resilient problems. In: Proceedings, ACM Symposium on Theory of Computing (STOC), pp. 438–451 (2017)
5. Awasthi, P., Blum, A., Sheffet, O.: Center-based clustering under perturbation stability. Inform. Process. Lett. 112(1–2), 49–54 (2012)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Resilient k-Clustering;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
2. Approximation algorithms for the fault-tolerant facility location problem with submodular penalties;Journal of Combinatorial Optimization;2024-02-26