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.
| Original language | English (US) |
|---|---|
| Title of host publication | Lecture Notes in Computer Science |
| Editors | L. Wang |
| Pages | 136-145 |
| Number of pages | 10 |
| Volume | 3595 |
| State | Published - 2005 |
| Event | 11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China Duration: Aug 16 2005 → Aug 29 2005 |
Other
| Other | 11th Annual International Conference on Computing and Combinatorics, COCOON 2005 |
|---|---|
| Country/Territory | China |
| City | Kunming |
| Period | 8/16/05 → 8/29/05 |
Keywords
- Approximation Algorithm
- Capacitated Multicast Routing
- Steiner Minimum Tree
- Tree Partitioning
ASJC Scopus subject areas
- Computer Science (miscellaneous)