Login / Signup

On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities.

Konstantinos GeorgiouAvner MagenIannis Tourlakis
Published in: FSTTCS (2009)
Keyphrases
  • vertex cover
  • planar graphs
  • approximation algorithms
  • search space
  • special case
  • closed form
  • partial order
  • semi definite programming