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

by   Dishant Goyal, et al.

In this work, we study a range of constrained versions of the k-supplier and k-center problems such as: capacitated, fault-tolerant, fair, etc. These problems fall under a broad framework of constrained clustering. A unified framework for constrained clustering was proposed by Ding and Xu [SODA 2015] in context of the k-median and k-means objectives. In this work, we extend this framework to the k-supplier and k-center objectives. This unified framework allows us to obtain results simultaneously for the following constrained versions of the k-supplier problem: r-gather, r-capacity, balanced, chromatic, fault-tolerant, strongly private, โ„“-diversity, and fair k-supplier problems, with and without outliers. We obtain the following results: We give 3 and 2 approximation algorithms for the constrained k-supplier and k-center problems, respectively, with ๐–ฅ๐–ฏ๐–ณ running time k^O(k)ยท n^O(1), where n = |C โˆช L|. Moreover, these approximation guarantees are tight; that is, for any constant ฯต>0, no algorithm can achieve (3-ฯต) and (2-ฯต) approximation guarantees for the constrained k-supplier and k-center problems in ๐–ฅ๐–ฏ๐–ณ time, assuming ๐–ฅ๐–ฏ๐–ณโ‰ ๐–ถ[2]. Furthermore, we study these constrained problems in outlier setting. Our algorithm gives 3 and 2 approximation guarantees for the constrained outlier k-supplier and k-center problems, respectively, with ๐–ฅ๐–ฏ๐–ณ running time (k+m)^O(k)ยท n^O(1), where n = |C โˆช L| and m is the number of outliers.


page 1

page 2

page 3

page 4

โˆ™ 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...
โˆ™ 11/02/2020

Fault-Tolerant Center Problems with Robustness and Fairness

We study a family of clustering problems that require fault-tolerant sol...
โˆ™ 05/02/2023

FPT Approximations for Capacitated/Fair Clustering with Outliers

Clustering problems such as k-Median, and k-Means, are motivated from ap...
โˆ™ 09/04/2018

Faster Balanced Clusterings in High Dimension

The problem of constrained clustering has attracted significant attentio...
โˆ™ 07/06/2022

Techniques for Generalized Colorful k-Center Problems

Fair clustering enjoyed a surge of interest recently. One appealing way ...
โˆ™ 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...
โˆ™ 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...

Please sign up or login with your details

Forgot password? Click here to reset