Multi-source spanning trees: Algorithms for minimizing source eccentricities

Discrete Applied Mathematics

Volumn 137, Issue 2, 2004, Pages 213-222

  McMahan, H Brendan ^a   Proskurowski, Andrzej ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

Algorithm; Communications; Graph; Multicast; Network; Shortest paths spanning trees

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; MULTICASTING; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

MULTI-SOURCE SPANNING TREES;

ALGORITHMS;

EID: 0346910255     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00262-2     Document Type: Conference Paper

References (11)

1. Connamacher H.S., Proskurowski A. The complexity of minimizing certain cost metrics for k-source spanning trees. Discrete Appl. Math. 131:2003;113.
2. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithm. 1990;MIT Press, Cambridge, MA.
3. E. Dahlhaus, P. Dankelmann, W. Goddard, H.C. Swart, MAD trees and distance hereditary graphs, in: D. Kratch (Ed.), Proceedings of JIM'2000, Metz, France, May 22-24 2000, pp. 49-54.
4. Farley A.M., Fragopoulou P., Krumme D.W., Proskurowski A., Richards D. Multi-source spanning tree problems. J. Interconnection Networks. 1:2000;61-71.
5. Hu T.C. Optimum communication spanning trees. SIAM J. Comput. 3(3):1974;188-195.
6. Johnson D.S., Lenstra J.K., Rinnooy Kan A.H.G. The complexity of the network design problem. Networks. 8(4):1978;279-285.
7. Krumme D.W., Fragopoulou P. Minimum eccentricity multicast trees. Discrete Mathematics and Theoretical Computer Science. 4:2001;157-172.
8. H.B. McMahan, A. Proskurowski, Multi-source spanning trees: algorithms for minimizing source eccentricities, in: D. Kratch (Ed.), Proceedings of JIM'2000, pp. 87-90.
9. Ravi R., Sundaram R., Marathe M.V., Rosenkrantz D.J., Ravi S.S. Spanning trees - short or small. SIAM J. Discrete Math. 9(2):1996;178-200.
10. Wu B.Y., Chao K., Tang C.Y. Approximation algorithms for some optimum communication spanning tree problems. Discrete Appl. Math. 102:2000;245-266.
11. D. Zappala, V. Lo, A. Fabbri, An evaluation of shared multicast tress with multiple active cores, J. Telecommunication Systems 19 (3), Metz, France, May 22-24 2000, (2002) 461-479.