FPT Approximation for Constrained Metric k-Median/Means

by   Dishant Goyal, et al.

The Metric k-median problem over a metric space (๐’ณ, d) is defined as follows: given a set L โŠ†๐’ณ of facility locations and a set C โŠ†๐’ณ of clients, open a set F โŠ† L of k facilities such that the total service cost, defined as ฮฆ(F, C) โ‰กโˆ‘_x โˆˆ Cmin_f โˆˆ F d(x, f), is minimised. The metric k-means problem is defined similarly using squared distances. In many applications there are additional constraints that any solution needs to satisfy. This gives rise to different constrained versions of the problem such as r-gather, fault-tolerant, outlier k-means/k-median problem. Surprisingly, for many of these constrained problems, no constant-approximation algorithm is known. We give FPT algorithms with constant approximation guarantee for a range of constrained k-median/means problems. For some of the constrained problems, ours is the first constant factor approximation algorithm whereas for others, we improve or match the approximation guarantee of previous works. We work within the unified framework of Ding and Xu that allows us to simultaneously obtain algorithms for a range of constrained problems. In particular, we obtain a (3+ฮต)-approximation and (9+ฮต)-approximation for the constrained versions of the k-median and k-means problem respectively in FPT time. In many practical settings of the k-median/means problem, one is allowed to open a facility at any client location, i.e., C โŠ† L. For this special case, our algorithm gives a (2+ฮต)-approximation and (4+ฮต)-approximation for the constrained versions of k-median and k-means problem respectively in FPT time. Since our algorithm is based on simple sampling technique, it can also be converted to a constant-pass log-space streaming algorithm.


page 1

page 2

page 3

page 4

โˆ™ 06/12/2021

FPT Approximation for Socially Fair Clustering

In this work, we study the socially fair k-median/k-means problem. We ar...
โˆ™ 10/27/2021

Tight FPT Approximation for Constrained k-Center and k-Supplier

In this work, we study a range of constrained versions of the k-supplier...
โˆ™ 08/13/2018

Speeding Up Constrained k-Means Through 2-Means

For the constrained 2-means problem, we present a O(dn+d(1ฯต)^O(1ฯต) n) ti...
โˆ™ 05/10/2022

Constant approximation for fault-tolerant median problems via iterative rounding

In this paper, we study the fault-tolerant matroid median and fault-tole...
โˆ™ 09/16/2019

Streaming PTAS for Constrained k-Means

We generalise the results of Bhattacharya et al. (Journal of Computing S...
โˆ™ 07/06/2019

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

Facility location is a prominent optimization problem that has inspired ...
โˆ™ 10/02/2018

A Unified Framework for Clustering Constrained Data without Locality Property

In this paper, we consider a class of constrained clustering problems of...

Please sign up or login with your details

Forgot password? Click here to reset