Improved approximation algorithms for the capacitated multicast routing problem

Authors:
Zhipeng Cai;Guohui Lin;Guoliang Xue
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Department of Computer Science and Engineering, Arizona State University, Tempe, Arizona
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 8
Cited 8

Heuristics with constant error guarantees for the design of tree networks

Management Science
Computer networks (3rd ed.)

Computer networks (3rd ed.)
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
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

An improved approximation algorithm for capacitated multicast routings in networks

Theoretical Computer Science
Approximating the Generalized Capacitated Tree-Routing Problem

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
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
Approximating capacitated tree-routings in networks

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On the approximation of the generalized capacitated tree-routing problem

Journal of Discrete Algorithms
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem

Theoretical Computer Science
Approximating capacitated tree-routings in networks

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two models for the Capacitated Multicast Routing Problem are considered, which are the Multicast k-Path Routing and the Multicast k-Tree Routing. Under these models, two improved approximation algorithms are presented, which have worst case performance ratios of 3 and (2 + ρ), respectively. Here ρ denotes the best approximation ratio for the Steiner Minimum Tree problem, and it is about 1.55 at the writing of the paper. The two approximation algorithms improve upon the previous best ones having performance ratios of 4 and (2.4 + ρ), respectively. The designing techniques developed in the paper could be applicable to other similar networking problems.