Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicast in large WDM networks
Progress in computer research
Multicasting and Broadcasting in Large WDM Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
| Hi-index | 0.00 |
We obtain the first non-trivial approximation algorithms for the Steiner Tree problem and the Generalized Steiner Tree problem in general directed graphs. Essentially no approximation algorithms were known for these problems. For the Directed Steiner Tree problem, we design a family of algorithms which achieve an approximation ratio of O(k^\epsilon) in time O(kn^{1/\epsilon}) for any fixed (\epsilon