A fast algorithm for Steiner trees
- 1 January 1981
- journal article
- Published by Springer Science and Business Media LLC in Acta Informatica
- Vol. 15 (2), 141-145
- https://doi.org/10.1007/bf00288961
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithmDiscrete Mathematics, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959