Author:
Bandyapadhyay Sayan,Banik Aritra,Bhore Sujoy
Funder
European Research Council,European Union
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. Anegg, G., Angelidakis, H., Kurpisz, A., Zenklusen, R.: A technique for obtaining true approximations for k-center with covering constraints. In: Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, vol. 12125, pp. 52–65. Springer (2020)
2. Bandyapadhyay, S., Banik, A., Bhore, S. On fair covering and hitting problems. In: Kowalik, L., Pilipczuk, M., Rzazewski, P. (eds.) Graph-Theoretic Concepts in Computer Science—47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers, vol. 12911 of Lecture Notes in Computer Science, pp. 39–51. Springer (2021)
3. Bandyapadhyay, S., Inamdar, T., Pai, S., Varadarajan, K. R.: A constant approximation for colorful k-center. In: 27th Annual European Symposium on Algorithms, ESA 2019, vol. 144 of LIPIcs, pp. 12:1–12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
4. Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39(2), 137–144 (2001)
5. Bera, S.K., Gupta, S., Kumar, A., Roy, S.: Approximation algorithms for the partition vertex cover problem. Theoret. Comput. Sci. 555, 2–8 (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献