An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

Authors:
Zhipeng Cai;Zhi-Zhong Chen;Guohui Lin;Lusheng Wang
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8;Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Japan 350-0394;Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8;Department of Computer Science, City University of Hong Kong, Hong Kong
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 8
Cited 2

Multimedia communications protocols and applications

Multimedia communications protocols and applications
Routing in the Internet (2nd ed.)

Routing in the Internet (2nd ed.)
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithms for multicast connection under multi-path routing model

Information Processing Letters
Routing algorithm for multicast under multi-tree model in optical networks

Theoretical Computer Science
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for capacitated multicast routings in networks

Theoretical Computer Science
Improved approximation algorithms for the capacitated multicast routing problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics

Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Capacitated Multicast Tree Routing Problem is considered, in which only a limited number of destination nodes are allowed to receive data in one routing tree and multiple routing trees are needed to send data from the source node to all destination nodes. The goal is to minimize the total cost of these routing trees. An improved approximation algorithm is presented, which has a worst case performance ratio of $\frac 85 + \frac 54\rho$. Here ρdenotes the best approximation ratio for the Steiner Minimum Tree problem, and it is about 1.55 at the writing of the paper. This improves upon the previous best having a performance ratio of 2 + ρ.