Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities.

Konstantinos Georgiou Avner Magen Iannis Tourlakis

Published in: IPCO (2008)

Keyphrases

vertex cover
planar graphs
approximation algorithms
sufficient conditions
minimum weight
approximate inference
partial order
minimum cost
precedence constraints
np hard
graphical models
constraint programming