Login / Signup
Local max-cut in smoothed polynomial time.
Omer Angel
Sébastien Bubeck
Yuval Peres
Fan Wei
Published in:
CoRR (2016)
Keyphrases
</>
max cut
planar graphs
special case
graph model
np hard
graph partitioning
np complete problems
worst case
spectral graph
minimum weight
genetic programming