A faster approximation algorithm for the Steiner problem in graphs
- 25 March 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 27 (3) , 125-128
- https://doi.org/10.1016/0020-0190(88)90066-x
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A faster approximation algorithm for the Steiner problem in graphsActa Informatica, 1986
- A fast algorithm for Steiner treesActa Informatica, 1981
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968