Max cut and semidefinite rank.

Renee Mirka David P. Williamson

Published in: Oper. Res. Lett. (2024)

Keyphrases

semidefinite
max cut
semidefinite programming
graph model
planar graphs
np hard
convex relaxation
interior point methods
sufficient conditions
higher dimensional
high dimensional
approximation algorithms
convex sets
machine learning
distance function