A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
2005
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05
Lovász and Schrijver described a generic method of tightening the LP and SDP relaxation for any 0-1 optimization problem. These tightened relaxations were the basis of several celebrated approximation algorithms (such as for MAX-CUT, MAX-3SAT, and SPARSEST CUT). We prove strong nonapproximability results in this model for well-known problems such as MAX-3SAT, Hypergraph Vertex Cover and Minimum Set Cover. We show that the relaxations produced by as many as Ω(n) rounds of the LS + procedure do
doi:10.1145/1060590.1060634
dblp:conf/stoc/AlekhnovichAT05
fatcat:kahlffldvjblthacbkazonyi3a