From post

Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes.

, и . IPCO, том 6655 из Lecture Notes in Computer Science, стр. 14-26. Springer, (2011)

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.

 

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

Van der Waerden's Theorem and Avoidability in Words., , и . CoRR, (2008)Generalized de Bruijn words for primitive words and powers.. Discret. Math., 338 (12): 2320-2331 (2015)A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.. University of Waterloo, Ontario, Canada, (2014)base-search.net (ftunivwaterloo:oai:uwspace.uwaterloo.ca:10012/8662).Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes., и . IPCO, том 6655 из Lecture Notes in Computer Science, стр. 14-26. Springer, (2011)