Approximating k-Center via Farthest-First on $δ$-Covers

The farthest-first traversal of Gonzalez is a classical $2$-approximation algorithm for solving the $k$-center problem, but its sequential nature makes it difficult to scale to very large datasets. In this work we study the effect of running farthest-first on a $δ$-cover of the dataset rather than on the full set of points. A $δ$-cover provides a compact summary of the data in which every point lies within distance $δ$ of some selected center. We prove that if farthest-first is applied to a $δ$-cover, the resulting $k$-center radius is at most twice the optimal radius plus $δ$. In our experiments on large high-dimensional datasets, we show that restricting the input to a $δ$-cover dramatically reduces the running time of the farthest-first traversal while only modestly increasing the $k$-center radius.