Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs.
Chung-Ming LinYin-Te TsaiChuan Yi TangPublished in: Inf. Process. Lett. (2006)
Keyphrases
- minimum spanning trees
- spanning tree
- minimum cost
- multiple sources
- edge disjoint
- minimum spanning tree
- minimum total cost
- np hard
- undirected graph
- approximation algorithms
- weighted graph
- shortest path
- edge weights
- machine learning
- metric space
- text classification
- distance measure
- principal component analysis
- data points
- objective function