An improved approximation algorithm for the capacitated multicast tree routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5165 LNCS, Issue , 2008, Pages 286-295

  Cai, Zhipeng ^a   Chen, Zhi Zhong ^b   Lin, Guohui ^a   Wang, Lusheng ^c  

^a UNIVERSITY OF ALBERTA   (Canada)

^b TOKYO DENKI UNIVERSITY   (Japan)

^c CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

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

Indexed keywords

APPROXIMATION ALGORITHMS; BEVERAGES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; MULTICASTING; OPTIMIZATION; PHOTOVOLTAIC EFFECTS; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS;

APPROXIMATION ALGORITHM; BEST APPROXIMATIONS; CAPACITATED MULTICAST TREE ROUTING; DESTINATION NODES; INTERNATIONAL CONFERENCES; MULTICAST TREES; MULTIPLE ROUTING; PERFORMANCE RATIO; ROUTING TREES; SOURCE NODES; STEINER MINIMUM TREE; STEINER MINIMUM TREES; TOTAL COSTS; TREE PARTITIONING; WORST-CASE PERFORMANCE RATIO;

TREES (MATHEMATICS);

EID: 51849092959     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_27     Document Type: Conference Paper

References (15)

1. Cai, Z.: Improved algorithms for multicast routing and binary fingerprint vector clustering. Master's thesis, Department of Computing Science, University of Alberta (June 16, 2004)
2. Cai, Z., Chen, Z.-Z., Lin, G.-H., Wang, L.: An improved approximation algorithm for the capacitated multicast tree routing problem. Technical Report TR08-06, Department of Computing Science, University of Alberta (May 2008)
3. Cai, Z., Lin, G.-H., Xue, G.L.: Improved approximation algorithms for the capacitated multicast routing problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 136-145. Springer, Heidelberg (2005)
4. Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Approximation algorithms for the Steiner tree problem in graphs. In: Du, D.-Z., Cheng, X. (eds.) Steiner Trees in Industries, pp. 235-279. Kluwer Academic Publishers, Dordrecht (2001)
5. Gu, J., Hu, X.D., Jia, X., Zhang, M.-H.: Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science 314, 293-301 (2004)
6. Gu, J., Hu, X.D., Zhang, M.-H.: Algorithms for multicast connection under multi-path routing model. Information Processing Letters 84, 31-39 (2002)
7. Hadas, R.L.: Efficient collective communication in WDM networks. In: Proceedings of IEEE ICCCN 2000, pp. 612-616 (2000)
8. Huitema, C.: Routing in the Internet. Prentice Hall PTR, Englewood Cliffs (2000)
9. Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Transactions on Algorithms 1, 265-282 (2005)
10. Kuo, F., Effelsberg, W., Garcia-Luna-Aceves, J.J.: Multimedia Communications: Protocols and Applications. Prentice Hall, Inc., Englewood Cliffs (1998)
11. Lin, G.-H.: An improved approximation algorithm for multicast k-tree routing. Journal of Combinatorial Optimization 9, 349-356 (2005)
12. Morsy, E., Nagamochi, H.: An improved approximation algorithm for capacitated multicast routings in networks. Theoretical Computer Science 390, 81-91 (2008)
13. Robins, G., Zelikovsky, A.Z.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770-779 (2000)
14. Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14, 1228-1234 (1996)
15. Zhang, X., Wei, J., Qiao, C.: Constrained multicast routing in WDM networks with sparse light splitting. In: Proceedings of IEEE INFOCOM 2000, March 26-30, pp. 1781-1790 (2000)