Max Cut and Hardness of Approximation
Speaker: YeongwooTitle: Max Cut and Hardness of Approximation
Date: 21 Feb 2023 16:30-18:00 EST
Location: SEC Level 3 NW Terrace
Food: Ethiopian
I’ll be talking about a series of works which showed that the Goemans-Williamson algorithm for Max-Cut is in fact the optimal algorithm under the Unique Games Conjecture. This will include a discussion on the GW algorithm itself, integrality gaps, and the result of Khot-Kindler-Mossel-O’Donnell which establishes the matching hardness results. If there is time, I’ll also introduce the Quantum variant of Max-Cut as well as my collaborators’ and my result on its hardness.