Siavosh Benabbas, Konstantinos Georgiou, Avner Magen. The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs. Electronic Colloquium on Computational Complexity (ECCC), 17:169, 2010. [doi]
@article{BenabbasGM10, title = {The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs}, author = {Siavosh Benabbas and Konstantinos Georgiou and Avner Magen}, year = {2010}, url = {http://eccc.hpi-web.de/report/2010/169}, tags = {graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/BenabbasGM10}, cites = {0}, citedby = {0}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, volume = {17}, pages = {169}, }