Simultaneous Max-Cut is harder to approximate than Max-Cut

Amey Bhangale, Subhash Khot. Simultaneous Max-Cut is harder to approximate than Max-Cut. Electronic Colloquium on Computational Complexity (ECCC), 26:148, 2019. [doi]

Abstract

Abstract is missing.