Key points are not available for this paper at this time.
We establish significantly improved bounds on the performance of the greedy algorithm for approximating set cover.
Share your take
Add a clinician perspective alongside expert commentary.
Petr Slavı́k (1996) studied this question.