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
An improved approximation algorithm for capacitated multicast routings in networks
Theoretical Computer Science
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
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
| Hi-index | 5.26 |
Given an underlying communication network represented as an edge-weighted graph G=(V,E), a source node s@?V, a set of destination nodes D@?V, and a capacity k which is a positive integer, the capacitated multicast tree routing problem asks for a minimum cost routing scheme for source s to send data to all destination nodes, under the constraint that in each routing tree at most k destination nodes are allowed to receive the data copies. The cost of the routing scheme is the sum of the costs of all individual routing trees therein. Improving on our previous approximation algorithm for the problem, we present a new algorithm which achieves a worst case performance ratio of 2089+7780+54@r, where @r denotes the best known approximation ratio for the Steiner minimum tree problem. Since @r is about 1.55 at the writing of the paper, the ratio achieved by our new algorithm is less than 3.4713. In comparison, the previously best ratio was 85+54@r~3.5375.