Subexponential LPs Approximate Max-Cut.

Samuel B. Hopkins Tselil Schramm Luca Trevisan

Published in: FOCS (2020)

Keyphrases

max cut
planar graphs
graph model
np complete problems
np hard
probabilistic model
pairwise
np complete
data clustering
graph partitioning