Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT.

Adi Avidor Uri Zwick

Published in: APPROX-RANDOM (2005)

Keyphrases

three dimensional
max cut
linear programming
optimal solution
semidefinite
feasible solution
linear programming relaxation
objective function
semidefinite programming
graph partitioning
approximation algorithms
min max
special case
evolutionary algorithm
planar graphs
spectral graph
pairwise