Corpus ID: 16472938

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

@article{Chlamtc2012UnderstandingSC,
  title={Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods},
  author={E. Chlamt{\'a}c and Zachary Friggstad and Konstantinos Georgiou},
  journal={ArXiv},
  year={2012},
  volume={abs/1204.5489}
}

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed