The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
From MaRDI portal
Publication:1408818
DOI10.1016/S0166-218X(02)00420-1zbMath1073.68061MaRDI QIDQ1408818
Andrzej Proskurowski, Harold S. Connamacher
Publication date: 25 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
An improved algorithm for the \(k\)-source maximum eccentricity spanning trees, On the intercluster distance of a tree metric, Multi-source spanning trees: Algorithms for minimizing source eccentricities., Minimax flow tree problems
Cites Work
- MAD trees and distance-hereditary graphs
- Multi-source spanning trees: Algorithms for minimizing source eccentricities.
- Approximation algorithms for some optimum communication spanning tree problems
- Optimum Communication Spanning Trees
- The complexity of the network design problem
- Spanning Trees—Short or Small
- Unnamed Item
- Unnamed Item