Faster Approximation Algorithms for k-Center via Data Reduction

Arnold Filtser, Shaofeng H. -C. Jiang, Yi Li +4

We study efficient algorithms for the Euclidean $k$-Center problem, focusing on the regime of large $k$. We take the approach of data reduction by considering $\hat{I}\pm$-coreset, which i…