Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems

07/06/2019
by   Kangsan Kim, et al.
0

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 disturbing 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 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. We also present the first constant-factor approximation algorithm for the parity-constrained k-center problem, the bottleneck optimization variant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2022

An O(loglog n)-Approximation for Submodular Facility Location

In the Submodular Facility Location problem (SFL) we are given a collect...
research
07/23/2020

FPT Approximation for Constrained Metric k-Median/Means

The Metric k-median problem over a metric space (𝒳, d) is defined as fol...
research
06/25/2020

Approximation Algorithms for Clustering with Dynamic Points

In many classic clustering problems, we seek to sketch a massive data se...
research
02/07/2018

Privacy preserving clustering with constraints

The k-center problem is a classical combinatorial optimization problem w...
research
11/27/2022

Socially Fair and Hierarchical Facility Location Problems

The classic facility location problem seeks to open a set of facilities ...
research
08/09/2023

Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints

The joint replenishment problem (JRP) is a classical inventory managemen...
research
02/27/2013

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization

Integration is affected by the curse of dimensionality and quickly becom...

Please sign up or login with your details

Forgot password? Click here to reset