That is, the Max-K-CUT problem, in addition to the SDP method, it also found that can be solved with the Local Search method! And can guarantee AbSolute Radio> (K-1) / K, the speed is also very fast, and has recently been implemented. Handle 1000 nodes of Full Graph, speed is around 60ms (2.8GHz, Windowxp), more dizzy is a PayLoad Balanced issue
1. There is no way to use mathematics to ensure Balanced Raido.
2. There is no rapid algorithm to ensure convergence (unless the size of Threshold)
