How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover.

Toshihiro Fujito

Published in: ACM Trans. Algorithms (2012)

Keyphrases

spanning tree
minimum cost
minimum spanning tree
np hard
tree structure
approximation ratio
dynamic programming
approximation algorithms
optimal solution
worst case
undirected graph
matching algorithm
knapsack problem
convergence rate
simulated annealing
network flow
string matching
similarity measure