FasterDSP: A faster approximation algorithm for directed steiner tree problem

Journal of Information Science and Engineering

Volumn 22, Issue 6, 2006, Pages 1409-1425

  Hsieh, Ming I ^a   Wu, Eric Hsiao Kuang ^a   Tsai, Meng Feng ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Approximation algorithm; Content delivery network; Directed steiner tree; Multicast distribution tree; Multicast routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHM; CONTENT DELIVERY NETWORK; DIRECTED STEINER TREE; MULTICAST DISTRIBUTION TREE; MULTICAST ROUTING;

TREES (MATHEMATICS);

EID: 33751513802     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems," Journal of Algorithms, Vol. 33, 1999, pp. 73-91.
2. A. Zelikovsky, "A series of approximation algorithms for the acyclic directed Steiner tree problem," Algorithmica, Vol. 18, 1997, pp. 99-110.
3. S. Roos, "Scheduling for ReMove and other partially connected architectures," Technical Report, No. 1-68340-44(2001)-05, Laboratory of Computer Engineering, Faculty of Information Technology and Systems, Deflt University of Technology, The Netherlands, 2001.
4. S. Ramanathan, "Multicast tree generation in networks with asymmetric links," IEEE/ACM Transactions on Networking, Vol. 4, 1996, pp. 558-568.
5. H. F. Salama, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks," in Proceedings of the IFIP 6th International Conference on High Performance Networking, 1995, pp. 27-42.
6. P. Winter, "Steiner problem in networks: a survey," Networks, Vol. 17, 1987, pp. 129-167.
7. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory ofNP-Completeness, W. H. Freeman and Company, San Francisco, 1978.
8. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1st ed., The MIT Press, 1990.
9. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, North-Holland, Amsterdam, 1992.
10. M. Bern and P. Plassman, "The Steiner problems with edge lengths 1 and 2," Information Processing Letters, Vol. 32, 1989, pp. 171-176.
11. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, Vol. 15, 1981, pp. 141-145.
12. P. Berman and V. Ramaiyer, "Improved approximation algorithms for the Steiner tree problem," Journal of Algorithms, Vol. 17, 1994, pp. 381-408.
13. H. Takahashi and A. Matsuyama, "An approximate solution for the Steiner problem in graphs," Mathematica Japonica, Vol. 24, 1980, pp. 573-577.
14. M. Karpinsky and A. Zelikovsky, "New approximation algorithms for the Steiner tree problem," Technical Report No. TR95-030, Electronic Colloquium on Computational Complexity (ECCC), 1995.
15. L. Zosin and S. Khuller, "On directed Steiner trees," in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 59-63.