A Tight Analysis of the Greedy Algorithm
β
Petr SlavΔ±Μk
π
Article
π
1997
π
Elsevier Science
π
English
β 214 KB
We establish significantly improved bounds on the performance of the greedy algorithm for approximating set co¨er. In particular, we provide the first substantial Ž . improvement of the 20-year-old classical harmonic upper bound, H m , of Johnson, Lovasz, and Chvatal, by showing that the performance