Approximation Algorithms for Directed Steiner Problems
Open Access
- 1 October 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 33 (1) , 73-91
- https://doi.org/10.1006/jagm.1999.1042
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Approximation Algorithms for Connected Dominating SetsAlgorithmica, 1998
- A series of approximation algorithms for the acyclic directed steiner tree problemAlgorithmica, 1997
- Multicast tree generation in networks with asymmetric linksIEEE/ACM Transactions on Networking, 1996
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed NetworksPublished by Springer Nature ,1995
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989
- Steiner problem in networks: A surveyNetworks, 1987
- A fast algorithm for Steiner treesActa Informatica, 1981