From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

New Lower Bounds for Vertex Cover in the Lovasz-Schrijver Hierarchy.. CCC, стр. 170-182. IEEE Computer Society, (2006)Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy., , и . STOC, стр. 294-303. ACM, (2005)On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities., , и . FSTTCS, том 4 из LIPIcs, стр. 203-214. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2009)Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.. APPROX-RANDOM, том 3624 из Lecture Notes in Computer Science, стр. 233-244. Springer, (2005)Integrality Gaps of 2-o(1) for Vertex Cover SDPs in the Lova-acutesz--Schrijver Hierarchy., , , и . SIAM J. Comput., 39 (8): 3553-3570 (2010)Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities., , и . IPCO, том 5035 из Lecture Notes in Computer Science, стр. 140-153. Springer, (2008)Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines.. CCC, стр. 22-. IEEE Computer Society, (2000)Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy., , , и . FOCS, стр. 702-712. IEEE Computer Society, (2007)