Advertisement

Rounding Applied to Set Cover

  • Vijay V. Vazirani

Abstract

We will introduce the technique of LP-rounding by using it to design two approximation algorithms for the set cover problem, Problem 2.1. The first is a simple rounding algorithm achieving a guarantee of f, where f is the frequency of the most frequent element. The second algorithm, achieving an approximation guarantee of O(log n), illustrates the use of randomization in rounding.

Keywords

Cover Problem Vertex Cover Fractional Cover Approximation Guarantee Vertex Cover Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 132.
    D.S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing, 11:555–556, 1982. (Cited on pp. 25, 123 )MathSciNetMATHCrossRefGoogle Scholar
  2. 252.
    A. Srinivasan. Improved approximations of packing and covering problems. In Proc. 27th ACM Symposium on the Theory of Computing,pages 268–276, 1995. (Cited on p. 123)Google Scholar
  3. 221.
    G.L. Nemhauser and L.E. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming,8:232–248, 1975. (Cited on p. 123)MathSciNetMATHCrossRefGoogle 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