Yet another algorithm for dense max cut: go greedy.

Claire Mathieu Warren Schudy

Published in: SODA (2008)

Keyphrases

dynamic programming
max cut
objective function
search space
k means
np hard
computational complexity
probabilistic model
simulated annealing
similarity measure
shortest path
graph partitioning
min max
special case
worst case
expectation maximization
greedy algorithm