Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks.

Miguel F. Anjos Henry Wolkowicz

Published in: J. Comb. Optim. (2002)

Keyphrases

semidefinite
max cut
semidefinite programming
graph model
convex relaxation
np hard
interior point methods
sufficient conditions
graph partitioning
higher dimensional
convex sets
singular value decomposition
planar graphs
pairwise
support vector machine
convex optimization