A faster approximation algorithm for the steiner tree problem in graphs
- 1 May 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 46 (2) , 79-83
- https://doi.org/10.1016/0020-0190(93)90201-j
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984