Connections between semidefinite relaxations of the max-cut and stable set problems.

Monique Laurent Svatopluk Poljak Franz Rendl

Published in: Math. Program. (1997)

Keyphrases

search algorithm
semidefinite
semidefinite programming
stable set
convex relaxation
max cut
search space
sufficient conditions
higher dimensional
interior point methods
linear programming
convex sets
pairwise
decision problems
convex optimization