1 Search Results for "Kim, Kangsan"

Document

DOI: 10.4230/LIPIcs.ISAAC.2020.21

Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem

Authors: Kangsan Kim, Yongho Shin, and Hyung-Chan An

Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)

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.

Cite as

Kangsan Kim, Yongho Shin, and Hyung-Chan An. Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{kim_et_al:LIPIcs.ISAAC.2020.21,
  author =	{Kim, Kangsan and Shin, Yongho and An, Hyung-Chan},
  title =	{{Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem}},
  booktitle =	{31st International Symposium on Algorithms and Computation (ISAAC 2020)},
  pages =	{21:1--21:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-173-3},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{181},
  editor =	{Cao, Yixin and Cheng, Siu-Wing and Li, Minming},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.21},
  URN =		{urn:nbn:de:0030-drops-133652},
  doi =		{10.4230/LIPIcs.ISAAC.2020.21},
  annote =	{Keywords: Facility location problems, approximation algorithms, clustering problems, parity constraints}
}

Refine by Author
1 An, Hyung-Chan
1 Kim, Kangsan
1 Shin, Yongho

Refine by Classification
1 Theory of computation → Approximation algorithms analysis
1 Theory of computation → Facility location and clustering

Refine by Keyword
1 Facility location problems
1 approximation algorithms
1 clustering problems
1 parity constraints

Refine by Type
1 document

Refine by Publication Year
1 2020

1 Search Results for "Kim, Kangsan"

Constant-Factor Approximation Algorithms for the Parity-Constrained Facility Location Problem

Abstract

Cite as

Thanks for your feedback!

Could not send message