Max-Cut is α_GW-hard to approximate on 3-colorable graphs, with an independent-set size threshold α* separating continued hardness from the existence of strictly better efficient approximations.
Goemans and David P
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets
Max-Cut is α_GW-hard to approximate on 3-colorable graphs, with an independent-set size threshold α* separating continued hardness from the existence of strictly better efficient approximations.