How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover.
Toshihiro FujitoPublished in: ICALP (1) (2006)
Keyphrases
- minimum cost
- spanning tree
- approximation ratio
- minimum spanning tree
- np hard
- tree structure
- search space
- approximation algorithms
- optimal solution
- worst case
- minimum cost flow
- computational complexity
- network flow
- objective function
- network flow problem
- integrality gap
- edit operations
- similarity measure
- minimal cost
- suffix tree
- simulated annealing
- bayesian networks