Bottleneck Multicast Trees in Linear Time

IEEE Communications Letters

Volumn 7, Issue 11, 2003, Pages 564-566

  Georgiadis, Leonidas ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Bottleneck multicast Tree; Bottleneck path; Min max Steiner tree; Multicasting

Indexed keywords

ALGORITHMS; COSTS; MULTICASTING; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS);

BOTTLENECK MULTICAST TREES; BOTTLENECK PATH;

TELECOMMUNICATION NETWORKS;

EID: 0344012970     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2003.820102     Document Type: Article

References (8)

1. R. Guerin and A. Orda, "Computing shortest paths for any number of hops," IEEE/ACM Trans. Networking, vol. 10, no. 5, pp. 613-620, Oct. 2002.
2. I. Papadimitriou and L. Georgiadis, "Energy-aware broadcasting in wireless networks," presented at the WiOpt'03: Modeling and optimization in mobile, ad hoc and wireless networks, Sophia-Antipolis, France, Mar. 3-5, 2003, pp. 267-277.
3. C. W. Duin and A. Volgenant, "The partial sum criterion for Steiner trees in graphs and shortest paths," Eur. J. Oper. Res., vol. 97, pp. 172-182, 1997.
4. P. M. Camerini, "The min-max spanning tree problem and some extensions," Inform. Processing Lett., vol. 7, no. 1, pp. 10-14, Jan. 1978.
5. H. N. Gabow and R. E. Tarjan, "Algorithms for two bottleneck optimization problems," J. Algorithms, vol. 9, pp. 411-417, 1988.
6. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice Hall, 1993.
7. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw Hill, 1990.
8. A. Anderson, T. Hagerup, S. Nilsson, and R. Raman, "Sorting in linear time?," presented at the 27th Annu. ACM Symp. on the Theory of Computing, Las Vegas, NV, May 1995, pp. 427-436.