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

  • Stavros Athanassopoulos
  • Ioannis Caragiannis
  • Christos Kaklamanis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4639)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Stavros Athanassopoulos
    • 1
  • Ioannis Caragiannis
    • 1
  • Christos Kaklamanis
    • 1
  1. 1.Research Academic Computer Technology Institute &, Department of Computer Engineering and Informatics, University of Patras, 26500 RioGreece

Personalised recommendations