Login / Signup
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids.
Kamalika Chaudhuri
Satish Rao
Samantha J. Riesenfeld
Kunal Talwar
Published in:
Theor. Comput. Sci. (2009)
Keyphrases
</>
optimal solution
computational complexity
np hard
dynamic programming
simulated annealing
minimum spanning tree
tree structure
knapsack problem
maximum flow
computer vision
image processing
objective function
probabilistic model
segmentation algorithm
energy function
spanning tree