A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.

Kamalika Chaudhuri Satish Rao Samantha J. Riesenfeld Kunal Talwar

Published in: ICALP (1) (2006)

Keyphrases

np hard
k means
push relabel
maximum flow
objective function
dynamic programming
optimal solution
evolutionary algorithm
computational complexity
worst case
linear programming
spectral clustering
similarity measure
simulated annealing
graphical models
markov chain
segmentation algorithm
knapsack problem