Set Cover via Dual Fitting

  • Vijay V. Vazirani


In this chapter we will introduce the method of dual fitting, which helps analyze combinatorial algorithms using LP-duality theory. Using this method, we will present an alternative analysis of the natural greedy algorithm (Algorithm 2.2) for the set cover problem (Problem 2.1). Recall that in Section 2.1 we deferred giving the lower bounding method on which this algorithm was based. We will provide the answer below. The power of this approach will become apparent when we show the ease with which it extends to solving several generalizations of the set cover problem (see Section 13.2).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 199.
    L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13: 383–390, 1975.MathSciNetCrossRefGoogle Scholar
  2. 50.
    V. Chvâtal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4: 233–235, 1979.MathSciNetCrossRefGoogle Scholar
  3. 235.
    S. Rajagopalan and V.V. Vazirani. Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM Journal on Computing, 28: 526–541, 1999.MathSciNetzbMATHGoogle Scholar
  4. 65.
    G. Dobson. Worst-case analysis of greedy heuristics for integer programming with non-negative data. Mathematics of Operations Research, 7: 515–531, 1982.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations