Elsevier

Journal of Algorithms

Volume 25, Issue 2, November 1997, Pages 237-254
Journal of Algorithms

Regular Article
A Tight Analysis of the Greedy Algorithm for Set Cover

https://doi.org/10.1006/jagm.1997.0887Get rights and content

Abstract

We establish significantly improved bounds on the performance of the greedy algorithm for approximatingset cover. In particular, we provide the first substantial improvement of the 20-year-old classical harmonic upper bound,H(m), of Johnson, Lovász, and Chvátal, by showing that the performance ratio of the greedy algorithm is, in fact,exactlyln m  ln ln m + Θ(1), wheremis the size of the ground set. The difference between the upper and lower bounds turns out to be less than 1.1. This provides the first tight analysis of the greedy algorithm, as well as the first upper bound that lies belowH(m) by a function going to infinity withm. We also show that the approximation guarantee for the greedy algorithm is better than the guarantee recently established by Srinivasan for the randomized rounding technique, thus improving the bounds on theintegrality gap. Our improvements result from a new approach which might be generally useful for attacking other similar problems.

References (13)

  • D.S. Johnson

    Approximation algorithms for combinatorial problems

    J. Comput. System Sci.

    (1974)
  • L. Lovász

    On the ratio of optimal integral and fractional covers

    Discrete Math.

    (1975)
  • V. Chvátal

    A greedy heuristic for the set-covering problem

    Math. Oper. Res.

    (1979)
  • P. Crescenzi, V. Kann, 1995, A Compendium of NP Optimization Problems, Department of Computer Science, University of...
  • U. Feige, A thereshold of lnn, Proceedings of the ACM Symposium on Theory of Computing, 1996, 314,...
  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
There are more references available in the full text version of this article.

Cited by (136)

  • On the explanatory power of Boolean decision trees

    2022, Data and Knowledge Engineering
  • Robust Bidirectional Poly-Matching

    2023, IEEE Transactions on Knowledge and Data Engineering
View all citing articles on Scopus

R. E. MillerJ. W. Thatcher, Eds.

*

E-mail: [email protected].

View full text