Reverse Greedy is Bad for k-Center

D Ellis Hershkowitz, Gregory Kehne

We show the reverse greedy algorithm is between a $(2k-2)$- and a $2k$-approximation for $k$-center.