Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost

Mong Jen Kao*

*此作品的通信作者

研究成果: Conference contribution同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題34th International Symposium on Algorithms and Computation, ISAAC 2023
編輯Satoru Iwata, Satoru Iwata, Naonori Kakimura
發行者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子)9783959772891
DOIs
出版狀態Published - 12月 2023
事件34th International Symposium on Algorithms and Computation, ISAAC 2023 - Kyoto, 日本
持續時間: 3 12月 20236 12月 2023

出版系列

名字Leibniz International Proceedings in Informatics, LIPIcs
283
ISSN(列印)1868-8969

Conference

Conference34th International Symposium on Algorithms and Computation, ISAAC 2023
國家/地區日本
城市Kyoto
期間3/12/236/12/23

指紋

深入研究「Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost」主題。共同形成了獨特的指紋。

引用此