1 paper
Franz G. Fuchs, Ruben P. Bassa, Frida Lien
The weighted MAX k-CUT problem involves partitioning a weighted undirected graph into k subsets, or colors, to maximize the sum of the weights of edges between vertices in differen…