New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy

@article{Tourlakis2006NewLB,
  title={New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy},
  author={Iannis Tourlakis},
  journal={21st Annual IEEE Conference on Computational Complexity (CCC'06)},
  year={2006},
  pages={170-182}
}
Lovdsz and Schrijver (1991) defined three progressively stronger procedures LS0, LS and LS+, for systematically tightening linear relaxations over many rounds. All three procedures yield the integral hull after at most n rounds. On the other hand, constant rounds of LS+ can derive the relaxations behind many famous approximation algorithms such as those for MAX-CUT, SPARSEST-CUT. So proving round lower bounds for these procedures on specific problems may give evidence about inapproximability… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…