Subhash Khot Georgia Tech Ryan O’Donnell Carnegie Mellon SDP Gaps and UGC-Hardness for Max-Cut-Gain & Max-Cut: Weighted graph H (say weights sum to 1). Find a subset…
