A Technique for Obtaining True Approximations for $k$-Center with Covering Constraints

Georg Anegg, Haris Angelidakis, Adam Kurpisz +1

There has been a recent surge of interest in incorporating fairness aspects into classical clustering problems. Two recently introduced variants of the $k$-Center problem in this s…