Corpus ID: 16472938

Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods

  title={Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods},
  author={E. Chlamt{\'a}c and Zachary Friggstad and Konstantinos Georgiou},
  • E. Chlamtác, Zachary Friggstad, Konstantinos Georgiou
  • Published 2012
  • Mathematics, Computer Science
  • ArXiv
  • Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light of this result, it is natural to ask whether such improvements can be achieved using lift-and-project methods. We present a simpler combinatorial algorithm which has nearly the same time-approximation tradeoff as the algorithm of Cygan et al., and which lends itself naturally to a lift-and-project based approach. At a… CONTINUE READING
    6 Citations
    Integrality Gaps for Bounded Color Matchings
    Integrality gaps for colorful matchings
    • PDF
    Limitations of Linear Programming Techniques for Bounded Color Matchings
    • G. Stamoulis
    • Mathematics, Computer Science
    • Electron. Colloquium Comput. Complex.
    • 2016
    Fair Colorful k-Center Clustering
    • 7
    • PDF


    Exponential-time approximation of weighted set cover
    • 78
    • Highly Influential
    • PDF
    Approximation Algorithms Using Hierarchies of Semidefinite Programming Relaxations
    • E. Chlamtác
    • Mathematics, Computer Science
    • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
    • 2007
    • 87
    • PDF
    A Tight Analysis of the Greedy Algorithm for Set Cover
    • P. Slavík
    • Mathematics, Computer Science
    • J. Algorithms
    • 1997
    • 305
    Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy
    • 48
    • Highly Influential
    • PDF
    Algorithmic construction of sets for k-restrictions
    • 275
    • PDF
    A tight analysis of the greedy algorithm for set cover
    • P. Slavík
    • Mathematics, Computer Science
    • STOC '96
    • 1996
    • 114
    Optimal algorithms and inapproximability results for every CSP?
    • 396
    • PDF
    Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
    • 69
    • Highly Influential
    • PDF
    Zero knowledge and the chromatic number
    • U. Feige, J. Kilian
    • Mathematics, Computer Science
    • Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
    • 1996
    • 244