Local max-cut in smoothed polynomial time.

Omer Angel Sébastien Bubeck Yuval Peres Fan Wei

Published in: STOC (2017)

Keyphrases

max cut
planar graphs
graph model
np complete problems
special case
np hard
computational complexity
graph partitioning
spectral graph
np complete
minimum weight
genetic algorithm
approximate inference
min max
approximation algorithms
greedy algorithm
scheduling problem
optimal solution