Sciweavers

Share
FCT
2007
Springer

Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs

10 years 2 months ago
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new algorithms further extend them by utilizing the natural idea of computing large packings of elements into sets of large size. Our results improve the previously best approximation bounds for the k-set cover problem for all values of k ≥ 6. The analysis technique could be of independent interest; the upper bound on the approximation factor is obtained by bounding the objective value of a factor-revealing linear program.
Stavros Athanassopoulos, Ioannis Caragiannis, Chri
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where FCT
Authors Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis
Comments (0)
books