A 3.4713-approximation algorithm for the capacitated multicast tree routing problem

Theoretical Computer Science

Volumn 410, Issue 52, 2009, Pages 5415-5424

  Cai, Zhipeng ^a   Chen, Zhi Zhong ^b   Lin, Guohui ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

Approximation algorithm; Capacitated multicast tree routing; Steiner minimum tree; Tree partitioning

Indexed keywords

APPROXIMATION RATIOS; CAPACITATED MULTICAST TREE ROUTING; COMMUNICATION NETWORKS; DESTINATION NODES; EDGE-WEIGHTED GRAPH; MINIMUM COST; POSITIVE INTEGERS; ROUTING SCHEME; ROUTING TREES; SOURCE NODES; STEINER MINIMUM TREE; STEINER MINIMUM TREES; TREE PARTITIONING; WORST-CASE PERFORMANCE RATIO;

APPROXIMATION ALGORITHMS; MULTICASTING; ROUTING PROTOCOLS;

ROUTING ALGORITHMS;

EID: 70449123289     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.05.013     Document Type: Article

References (17)

1. Bharath-Kumar K., and Jaffe J.M. Routing to multiple destinations in computer networks. IEEE Transaction on Communications 31 (1983) 343-351
2. Z. Cai, Improved algorithms for multicast routing and binary fingerprint vector clustering. Master's thesis, Department of Computing Science, University of Alberta, June 16, 2004
3. Cai Z., Chen Z.-Z., Lin G.-H., and Wang L. An improved approximation algorithm for the capacitated multicast tree routing problem. Proceedings of the Second Annual International Conference on Combinatorial Optimization and Applications, COCOA 2008. LNCS vol. 5165 (2008) 286-295
4. Cai Z., Lin G.-H., and Xue G. Improved approximation algorithms for the capacitated multicast routing problem. Proceedings of the Eleventh International Computing and Combinatorics Conference, COCOON 2005. LNCS vol. 3593 (2005) 136-145
5. Gröpl C., Hougardy S., Nierhoff T., and Prömel H.~J. Approximation algorithms for the Steiner tree problem in graphs. In: Du D.-Z., and Cheng X. (Eds). Steiner Trees in Industries (2001), Kluwer Academic Publishers 235-279
6. Gu J., Hu X.D., Jia X., and Zhang M.-H. Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science 314 (2004) 293-301
7. Gu J., Hu X.~D., and Zhang M.-H. Algorithms for multicast connection under multi-path routing model. Information Processing Letters 84 (2002) 31-39
8. Huitema C. Routing in the Internet (2000), Prentice Hall PTR
9. Jothi R., and Raghavachari B. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004. LNCS vol. 3142 (2004) 805-818
10. Kuo F., Effelsberg W., and Garcia-Luna-Aceves J.J. Multimedia Communications: Protocols and Applications (1998), Prentice Hall, Inc.
11. R. Libeskind-Hadas, Efficient collective communication in WDM networks with a power budget, in: Proceedings of the Ninth IEEE Conference on Computer Communications and Networks, ICCCN 2000, 2000, pp. 612-616
12. Lin G.-H. An improved approximation algorithm for multicast k-tree routing. Journal of Combinatorial Optimization 9 (2005) 349-356
13. Morsy E., and Nagamochi H. An improved approximation algorithm for capacitated multicast routings in networks. Theoretical Computer Science 390 (2008) 81-91
14. G. Robins, A.Z. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 2000, pp. 770-779
15. Sahasrabuddhe L.H., and Mukherjee B. Multicast routing algorithms and protocols: A tutorial. IEEE Networks 14 (2000) 90-102
16. Wang Z., and Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14 (1996) 1228-1234
17. X. Zhang, J. Wei, C. Qiao, Constrained multicast routing in WDM networks with sparse light splitting, in: Proceedings of IEEE INFOCOM 2000, 2000, pp. 1781-1790