Login / Signup
Subsampling Semidefinite Programs and Max-Cut on the Sphere.
Boaz Barak
Moritz Hardt
Thomas Holenstein
David Steurer
Published in:
Electron. Colloquium Comput. Complex. (2009)
Keyphrases
</>
semidefinite
max cut
semidefinite programming
np hard
planar graphs
graph model
higher dimensional
convex relaxation
sufficient conditions
convex sets
np complete problems
multistage
linear programming
interior point methods
pairwise
image segmentation
support vector machine
special case