Login / Signup

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

Yu Hin AuLevent Tunçel
Published in: IPCO (2011)
Keyphrases
  • stable set
  • maximum matching
  • worst case
  • lower bound
  • np hard
  • orders of magnitude
  • computational complexity
  • search strategies