Multi-source spanning trees: Algorithms for minimizing source eccentricities.

DOI10.1016/S0166-218X(03)00262-2zbMath1062.68090OpenAlexW1991032379MaRDI QIDQ1427201

Andrzej Proskurowski, H. Brendan McMahan

Publication date: 14 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00262-2

zbMATH Keywords

AlgorithmCommunicationsGraphMulticastNetworkShortest-paths spanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

An improved algorithm for the \(k\)-source maximum eccentricity spanning trees ⋮ The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. ⋮ Multi-source spanning trees: Algorithms for minimizing source eccentricities. ⋮ Minimax flow tree problems

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
• 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

This page was built for publication: Multi-source spanning trees: Algorithms for minimizing source eccentricities.