Reverse Greedy is Bad for k-Center
Abstract
We show the reverse greedy algorithm is between a (2k-2)- and a 2k-approximation for k-center.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.