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.
Petr Slavı́k (Mon,) studied this question.