A faster approximation algorithm for the Steiner problem in graphs
- 1 May 1986
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 23 (2) , 223-229
- https://doi.org/10.1007/bf00289500
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- An algorithm for the steiner problem in graphsNetworks, 1984
- A short proof of a result of Pollak on Steiner minimal treesJournal of Combinatorial Theory, Series A, 1982
- A fast algorithm for Steiner treesActa Informatica, 1981
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Some remarks on the Steiner problemJournal of Combinatorial Theory, Series A, 1978
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956