Heuristics with constant error guarantees for the design of tree networks
Management Science
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
Routing algorithm for multicast under multi-tree model in optical networks
Theoretical Computer Science
An improved approximation algorithm for capacitated multicast routings in networks
Theoretical Computer Science
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
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
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Multicast routing algorithms and protocols: a tutorial
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 5.23 |
In the multicast k-tree routing problem, a data copy is sent from the source node to at most k destination nodes in every transmission. The goal is to minimize the total cost of sending data to all destination nodes, which is measured as the sum of the costs of all routing trees. This problem was formulated out of optical networking and has applications in general multicasting. Several approximation algorithms, with increasing performance, have been proposed in the last several years; the most recent ones rely heavily on a tree partitioning technique. In this paper, we present a further improved approximation algorithm along the line. The algorithm has a worst-case performance ratio of 54@r+32, where @r denotes the best approximation ratio for the Steiner minimum tree problem. The proofs of the technical routing lemmas also provide some insights into why such a performance ratio could be the best possible that one can get using this tree partitioning technique.