Key points are not available for this paper at this time.
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of the nodes into two subsets, such that the sum of the weights of the edges having endpoints in different subsets is maximized.
Festa et al. (2002) studied this question.