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 . 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∈+∈ρ. © Springer-Verlag Berlin Heidelberg 2008.
Author supplied keywords
Cite
CITATION STYLE
Cai, Z., Chen, Z. Z., Lin, G., & Wang, L. (2008). An improved approximation algorithm for the capacitated multicast tree routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5165 LNCS, pp. 286–295). https://doi.org/10.1007/978-3-540-85097-7_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
