Subsampling Semidefinite Programs and Max-Cut on the Sphere

Boaz Barak Moritz Hardt Thomas Holenstein David Steurer

Published in: CoRR (2009)

Keyphrases

semidefinite
max cut
semidefinite programming
graph model
convex relaxation
np hard
np complete problems
planar graphs
sufficient conditions
higher dimensional
multistage
interior point methods
convex sets
np complete
text classification
linear programming
bayesian networks