The Randomized max-cut problem is to find an efficient randomized algorithm which takes as input a graph G and which outputs a cut (S,T) of G
1. The Randomized max-cut problem is to find an efficient randomized algorithm which takes as input a graph G and which outputs a cut (S,T) of G. In this problem we also want to compare this algorithm to the 2-approximation for max cut given in class. Here is the randomized algorithm for constructing a cut […]