Improving Minimum Cost Spanning Trees by Upgrading Nodes.
Sven Oliver KrumkeMadhav V. MaratheHartmut NoltemeierR. RaviS. S. RaviRavi SundaramHans-Christoph WirthPublished in: J. Algorithms (1999)
Keyphrases
- spanning tree
- minimum cost
- np hard
- minimum spanning tree
- approximation algorithms
- edge disjoint
- undirected graph
- root node
- minimum spanning trees
- network flow
- network flow problem
- network simplex algorithm
- capacity constraints
- edit operations
- leaf nodes
- minimum cost flow
- edge weights
- objective function
- ant colony optimization
- random walk
- data structure