10 citations · 33 across the 24 of their papers we have counts for
4 papers · 2 filters
On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications
Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov
Fair clustering is a constrained variant of clustering where the goal is to partition a set of colored points, such that the fraction of points of any color in every cluster is mor…
Approximate Covering with Lower and Upper Bounds via LP Rounding
Sayan Bandyapadhyay, Aniket Basu Roy
In this paper, we study the lower- and upper-bounded covering (LUC) problem, where we are given a set of points, a collection of balls, and parameters and…
Improved Bounds for Metric Capacitated Covering Problems
Sayan Bandyapadhyay
In the Metric Capacitated Covering (MCC) problem, given a set of balls in a metric space with metric and a capacity parameter , the goal is to find a minim…
On Perturbation Resilience of Non-Uniform -Center
Sayan Bandyapadhyay
The Non-Uniform -center (NUkC) problem has recently been formulated by Chakrabarty, Goyal and Krishnaswamy [ICALP, 2016] as a generalization of the classical -center clusteri…