Document Open Access Logo

Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost

Author Mong-Jen Kao

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2023.45.pdf
  • Filesize: 0.69 MB
  • 14 pages

Document Identifiers

Author Details

Mong-Jen Kao
  • Department of Computer Science, National Yang-Ming Chiao-Tung University, Hsinchu, Taiwan

Funding

  • Kao, Mong-Jen: Supported in part by National Science and Technology Council (NSTC), Taiwan, under Grants 111-2221-E-A49-118-MY3, 112-2628-E-A49-017-MY3, and 112-2634-F-A49-001-MBK.

Cite AsGet BibTex

Mong-Jen Kao. Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 45:1-45:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.ISAAC.2023.45

Abstract

We consider the hard-capacitated facility location problem with uniform facility cost (CFL-UFC). This problem arises as an indicator variation between the general CFL problem and the uncapacitated facility location (UFL) problem, and is related to the profound capacitated k-median problem (CKM). In this work, we present a rounding-based 4-approximation algorithm for this problem, built on a two-staged rounding scheme that incorporates a set of novel ideas and also techniques developed in the past for both facility location and capacitated covering problems. Our result improves the decades-old LP-based ratio of 5 for this problem due to Levi et al. since 2004. We believe that the techniques developed in this work are of independent interests and may further lead to insights and implications for related problems.

Subject Classification

ACM Subject Classification
  • Theory of computation → Facility location and clustering
Keywords
  • Capacitated facility location
  • Hard capacities
  • Uniform facility cost

Metrics

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

Related Versions

References

  1. Karen Aardal, Pieter L. van den Berg, Dion Gijswijt, and Shanfei Li. Approximation algorithms for hard capacitated k-facility location problems. Eur. J. Oper. Res., 242(2):358-368, 2015. URL: https://doi.org/10.1016/j.ejor.2014.10.011.
  2. Hyung-Chan An, Mohit Singh, and Ola Svensson. Lp-based algorithms for capacitated facility location. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pages 256-265. IEEE Computer Society, 2014. URL: https://doi.org/10.1109/FOCS.2014.35.
  3. Manisha Bansal, Naveen Garg, and Neelima Gupta. A 5-approximation for capacitated facility location. In Leah Epstein and Paolo Ferragina, editors, Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, volume 7501 of Lecture Notes in Computer Science, pages 133-144. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-33090-2_13.
  4. Jarosław Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, and Khoa Trinh. An improved approximation for k-median and positive correlation in budgeted optimization. ACM Trans. Algorithms, 13(2), March 2017. URL: https://doi.org/10.1145/2981561.
  5. Kishen N. Gowda, Thomas W. Pensyl, Aravind Srinivasan, and Khoa Trinh. Improved bi-point rounding algorithms and a golden barrier for k-median. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 987-1011. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch38.
  6. Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, and Vijay V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. J. ACM, 50(6):795?824, November 2003. URL: https://doi.org/10.1145/950620.950621.
  7. Kamal Jain, Mohammad Mahdian, and Amin Saberi. A new greedy approach for facility location problems. In Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, STOC '02, pages 731-740, New York, NY, USA, 2002. Association for Computing Machinery. URL: https://doi.org/10.1145/509907.510012.
  8. Kamal Jain and Vijay V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. J. ACM, 48(2):274-296, March 2001. URL: https://doi.org/10.1145/375827.375845.
  9. Mong-Jen Kao. Iterative partial rounding for vertex cover with hard capacities. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '17, pages 2638-2653, USA, 2017. Society for Industrial and Applied Mathematics. Google Scholar
  10. Mong-Jen Kao. On the integrality gap of mfn relaxation for the capacitated facility location problem. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1071-1089, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch40.
  11. Retsef Levi, David B. Shmoys, and Chaitanya Swamy. Lp-based approximation algorithms for capacitated facility location. In George L. Nemhauser and Daniel Bienstock, editors, Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, volume 3064 of Lecture Notes in Computer Science, pages 206-218. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-25960-2_16.
  12. Shi Li and Ola Svensson. Approximating k-median via pseudo-approximation. In Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC '13, page 901?910, New York, NY, USA, 2013. Association for Computing Machinery. URL: https://doi.org/10.1145/2488608.2488723.
  13. Mohammad Mahdian and Martin Pál. Universal facility location. In Giuseppe Di Battista and Uri Zwick, editors, Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, volume 2832 of Lecture Notes in Computer Science, pages 409-421. Springer, 2003. URL: https://doi.org/10.1007/978-3-540-39658-1_38.
  14. M. Pál, É. Tardos, and T. Wexler. Facility location with nonuniform hard capacities. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, FOCS '01, page 329, USA, 2001. IEEE Computer Society. Google Scholar
  15. David B. Shmoys, Éva Tardos, and Karen Aardal. Approximation algorithms for facility location problems (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC '97, pages 265-274, New York, NY, USA, 1997. Association for Computing Machinery. URL: https://doi.org/10.1145/258533.258600.
  16. Vincent Cohen-Addad Viallat, Fabrizio Grandoni, Euiwoong Lee, and Chris Schwiegelshohn. Breaching the 2 LMP approximation barrier for facility location with applications to k-median. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 940-986. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch37.
  17. David P. Williamson and David B. Shmoys. The Design of Approximation Algorithms. Cambridge University Press, USA, 1st edition, 2011. Google Scholar
  18. Jiawei Zhang, Bo Chen, and Yinyu Ye. A multi-exchange local search algorithm for the capacitated facility location problem: (extended abstract). In George L. Nemhauser and Daniel Bienstock, editors, Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, volume 3064 of Lecture Notes in Computer Science, pages 219-233. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-25960-2_17.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact