Advertisement

Set Cover

  • Vijay V. Vazirani
Chapter

Abstract

The set cover problem plays the same role in approximation algorithms that the maximum matching problem played in exact algorithms — as a problem whose study led to the development of fundamental techniques for the entire field. For our purpose this problem is particularly useful, since it offers a very simple setting in which many of the basic algorithm design techniques can be explained with great ease. In this chapter, we will cover two combinatorial techniques: the fundamental greedy technique and the technique of layering. In Part II we will explain both the basic LP-based techniques of rounding and the primal-dual schema using this problem. Because of its generality, the set cover problem has wide applicability, sometimes even in unexpected ways. In this chapter we will illustrate such an application — to the shortest superstring problem (see Chapter 7 for an improved algorithm for the latter problem).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 50.
    V. Chvâtal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4:233–235, 1979. (Cited on pp. 26, 117 )MathSciNetCrossRefGoogle Scholar
  2. 86.
    U. Feige. A treshold of In n for approximating set cover. Journal of the ACM,45:634–652, 1998. (Cited on pp. 26,331, 332)MathSciNetCrossRefGoogle Scholar
  3. 157.
    D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256–278, 1974. (Cited on pp. 10, 26, 138 )MathSciNetCrossRefGoogle Scholar
  4. 194.
    M. Li. Towards a DNA sequencing theory. In Proc. 81st IEEE Annual Symposium on Foundations of Computer Science,pages 125–134, 1990. (Cited on p. 26)Google Scholar
  5. 199.
    L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383–390, 1975. (Cited on pp. 11, 26, 117 )MathSciNetCrossRefGoogle Scholar
  6. 206.
    C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. Journal of the ACM, 41:960–981, 1994. (Cited on pp. 26, 332 )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