Complex Semidefinite Programming and Max-k-Cut

27 Dec 2018 Newman Alantha

In a second seminal paper on the application of semidefinite programming to graph partitioning problems, Goemans and Williamson showed how to formulate and round a complex semidefinite program to give what is to date still the best-known approximation guarantee of .836008 for Max-$3$-Cut. (This approximation ratio was also achieved independently by De Klerk et al.) Goemans and Williamson left open the problem of how to apply their techniques to Max-$k$-Cut for general $k$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATA STRUCTURES AND ALGORITHMS