… problems. Two recently introduced variants of the k-Center problem in this spirit are Colorful
k-Center, … models, such as the Fair Robust k-Center problem introduced by Harris, Pensyl, …

… of the k-Center problem in this spirit are Colorful k-Center, … as the Fair Robust k-Center problem
introduced by Harris, … to traditional k-Center, include additional covering constraints. Prior …

… , since j < 2i , we have rj ≥ ̂ri and so we cover whatever the balls from ̂S covered. … NUkC
problem that generalizes the classic k-center problem and the k-center with outlier problem. …

… k-center problem with outliers, which is equivalent to only having red points and needing to
cover at least … more challenging than the classic k-center problem: only recent results give …

… minimal. Then the union of the closed balls with k centers \(x^1, \ldots , x^k\) and the same
radius r would cover … Thus, the objective of the k-center problem is to find k balls to cover all of …

… k-center problem with outliers, which is equivalent to only having red points and needing to
cover at least … more challenging than the classic k-center problem: only recent results give …

… algorithm for k-Center. We show how the Priority k-Center problem is related to two different
notions of fair clustering [HPST19… We want to ensure that at least m units of coverage are …

… variants of the capacitated vertex k-center problem. In this paper, … this problem just as the
capacitated vertex k-center problem. … vertex k-center problem and the NP-Hard set covering and …

… k-supplier problem, which is a generalization of kcenter, … cover two elements of such
independent set. Based on the two satisfied inequalities for index j, we can find k suppliers covering …

… In the Non-Uniform k-Center (NUkC) problem, a generalization of the famous k-center
clustering problem, we want to cover the given set of points in a metric space by finding a …