Improved approximation algorithms for MAX k-CUT and MAX BISECTION

1994-01-01T00:00:00Z (GMT) by Frieze Jerrum
Abstract: "Polynomial-time approximation algorithms with non-trivial performance guarantees are presented for the problems of (a) partitioning the vertices of a weighted graph into k blocks so as to maximise the weight of crossing edges, and (b) partitioning the vertices of a weighted graph into two blocks of equal cardinality, again so as to maximise the weight of crossing edges. The approach, pioneered by Goemans and Williamson, is via a semidefinite relaxation."