… An instance of colorful k-center consists of points in a metric space that are colored red or
blue, … The other motive for studying the colorful k-center problem derives from the algorithmic …

… An instance of colorful k-center consists of points in a metric space that are colored red or
blue, … The other motive for studying the colorful k-center problem derives from the algorithmic …

… Fair k-Center In the full version of the paper we show that for the special case of k-center
in finite metrics, we can compute a set of k-centers that induce a 3-approximate …

… adding fairness constraints to kcenter clustering. We use points with different colors to present
individuals … We assume that the color of points in S1 is red, the color of points in S2 is blue. …

… Fair clustering enjoyed a surge of interest recently. One appealing way of integrating … colorful
setting), specialized techniques have only been developed recently for k-Center clustering …

… In this paper, we present an improved coreset-based strategy for fair 𝑘-center clustering of
multi-colored points in general metrics, whose accuracy/performance tradeoffs are analyzed …

… In this paper, we study the k-center clustering problem under this notion of fairness. While
the existing fair clustering … where at each center c ∈ C, we place Profile[c][γ] points of color γ. …

… In this paper, we study the problem of fair clustering on the k−center objective. In fair clustering,
… each point in the input has a “color” (representing its group), they defined fair cluster as a …

… (REP-KC), the input is a finite metric space with colored points and the goal is to construct a
k-Center clustering that contains a certain number of centers/representatives from each color …

… to any clustering problem, giving rise to fair k-center, fair k… is NP-hard in the case of fair
k-center. Chierichetti et al. tackle … for fair k-center/k-supplier with multiple colors and exact ratio …