1 problem

Three-candidate Plurality is Stablest hardness consequence for MAX-3-CUT
Sharp hardness consequence. For every $\varepsilon>0$ , it is NP-hard to approximate MAX-3-CUT within a multiplicative factor of $\alpha_{3}+\varepsilon$ .
openhardness-of-approximation max-3-cut unique-games
0 responses
05

Three-candidate Plurality is Stablest hardness consequence for MAX-3-CUT