Funder
European Research Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference33 articles.
1. Aggarwal, Ankit, Louis, Anand, Bansal, Manisha, Garg, Naveen, Gupta, Neelima, Gupta, Shubham, Jain, Surabhi: A 3-approximation algorithm for the facility location problem with uniform capacities. Math. Program. 141(1–2), 527–547 (2013)
2. Ahmadian, Sara., Swamy Chaitanya.: Improved approximation guarantees for lower-bounded facility location. In Thomas Erlebach and Giuseppe Persiano, editors, Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers, volume 7846 of Lecture Notes in Computer Science, pages 257–271. Springer, 2012
3. An, Hyung-Chan., Bhaskara, Aditya, Chekuri, Chandra, Gupta, Shalmoli, Madan, Vivek, Svensson, Ola: Centrality of trees for capacitated k-center. Math. Program. 154(1–2), 29–53 (2015)
4. An, Hyung-Chan., Singh, Mohit, Svensson, Ola: Lp-based algorithms for capacitated facility location. SIAM J. Comput. 46(1), 272–306 (2017)
5. Bandyapadhyay Sayan.: Improved bounds for metric capacitated covering problems. In Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors, 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference), volume 173 of LIPIcs, pages 9:1–9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020