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.
KeywordsCover Problem Vertex Cover Fractional Cover Approximation Guarantee Vertex Cover Problem
Unable to display preview. Download preview PDF.
- 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