Sciweavers

IPCO
2008
87views Optimization» more  IPCO 2008»
13 years 6 months ago
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
We consider the standard semidefinite programming (SDP) relaxation for vertex cover to which all hypermetric inequalities supported on at most k vertices have been added. We show t...
Konstantinos Georgiou, Avner Magen, Iannis Tourlak...