Constant-factor approximation algorithms for the parity-constrained facility location problem

Kangsan Kim, Yongho Shin, Hyung Chan An

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting typical structures within the optimization problems of practical interest, little is known on how the problem behaves in conjunction with parity constraints. This shortfall of understanding was rather discouraging when we consider the central role of parity in the field of combinatorics. In this paper, we present the first constant-factor approximation algorithm for the facility location problem with parity constraints. We are given as the input a metric on a set of facilities and clients, the opening cost of each facility, and the parity requirement – odd, even, or unconstrained – of every facility in this problem. The objective is to open a subset of facilities and assign every client to an open facility so as to minimize the sum of the total opening costs and the assignment distances, but subject to the condition that the number of clients assigned to each open facility must have the same parity as its requirement. Although the unconstrained facility location problem as a relaxation for this parity-constrained generalization has unbounded gap, we demonstrate that it yields a structured solution whose parity violation can be corrected at small cost. This correction is prescribed by a T-join on an auxiliary graph constructed by the algorithm. This auxiliary graph does not satisfy the triangle inequality, but we show that a carefully chosen set of shortcutting operations leads to a cheap and sparse T-join. Finally, we bound the correction cost by exhibiting a combinatorial multi-step construction of an upper bound.

Original languageEnglish
Title of host publication31st International Symposium on Algorithms and Computation, ISAAC 2020
EditorsYixin Cao, Siu-Wing Cheng, Minming Li
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages211-2117
Number of pages1907
ISBN (Electronic)9783959771733
DOIs
Publication statusPublished - 2020 Dec
Event31st International Symposium on Algorithms and Computation, ISAAC 2020 - Virtual, Hong Kong, China
Duration: 2020 Dec 142020 Dec 18

Publication series

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

Conference

Conference31st International Symposium on Algorithms and Computation, ISAAC 2020
Country/TerritoryChina
CityVirtual, Hong Kong
Period20/12/1420/12/18

Bibliographical note

Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. NRF-2019R1C1C1008934). This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. NRF-2016R1C1B1012910). This research was supported by the Yonsei University Research Fund of 2018-22-0093.

Publisher Copyright:
© Kangsan Kim, Yongho Shin, and Hyung-Chan An.

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Constant-factor approximation algorithms for the parity-constrained facility location problem'. Together they form a unique fingerprint.

Cite this