Approximating k-Center via Farthest-First on $\hat{I}´$-Covers

Jason R. Wilson

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 ver…