126
click to vote
IPCO
2008
15 years 5 months ago
2008
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...