SearchSkip to Search Results
- 2Approximation algorithms
- 1Capacitated Multicast Routing
- 1Capacitated multicast routing
- 1Steiner Minimum Tree
- 1Steiner minimum tree
- 1Tree Partitioning
Technical report TR08-06. 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...
Technical report TR04-12. For the Capacitated Multicast Routing Problem, we considered two models which are the Multicast k-Path Routing and the Multicast k-Tree Routing. We presented two improved approximation algorithms for them, which have worst case performance ratios of 3 and (2 + ρ) (ρ is...