Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost

Mong Jen Kao*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publication34th International Symposium on Algorithms and Computation, ISAAC 2023
EditorsSatoru Iwata, Satoru Iwata, Naonori Kakimura
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772891
DOIs
StatePublished - Dec 2023
Event34th International Symposium on Algorithms and Computation, ISAAC 2023 - Kyoto, Japan
Duration: 3 Dec 20236 Dec 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume283
ISSN (Print)1868-8969

Conference

Conference34th International Symposium on Algorithms and Computation, ISAAC 2023
Country/TerritoryJapan
CityKyoto
Period3/12/236/12/23

Keywords

  • Capacitated facility location
  • Hard capacities
  • Uniform facility cost

Fingerprint

Dive into the research topics of 'Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost'. Together they form a unique fingerprint.

Cite this