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

Yu-Hin Au, Levent Tunçel. Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. In Oktay Günlük, Gerhard J. Woeginger, editors, Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings. Volume 6655 of Lecture Notes in Computer Science, pages 14-26, Springer, 2011. [doi]

Abstract

Abstract is missing.