Revisiting Priority k-Center: Fairness and Outliers

03/04/2021
by   Tanvi Bajpai, et al.
0

In the Priority k-Center problem, the input consists of a metric space (X,d), an integer k and for each point v ∈ X a priority radius r(v). The goal is to choose k-centers S ⊆ X to minimize max_v ∈ X1/r(v) d(v,S). If all r(v)'s were uniform, one obtains the classical k-center problem. Plesník [Plesník, Disc. Appl. Math. 1987] introduced this problem and gave a 2-approximation algorithm matching the best possible algorithm for vanilla k-center. We show how the problem is related to two different notions of fair clustering [Harris et al., NeurIPS 2018; Jung et al., FORC 2020]. Motivated by these developments we revisit the problem and, in our main technical contribution, develop a framework that yields constant factor approximation algorithms for Priority k-Center with outliers. Our framework extends to generalizations of Priority k-Center to matroid and knapsack constraints, and as a corollary, also yields algorithms with fairness guarantees in the lottery model of Harris et al.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset