On approximation algorithms for Steiner's problem in graphs
Author:
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 17-28
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- STEINER PROBLEMS IN GRAPHS: ALGORITHMS AND APPLICATIONSEngineering Optimization, 1983
- A fast algorithm for Steiner treesActa Informatica, 1981
- Reducibility among Combinatorial Problems1972
- 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