An algorithm for the steiner problem in graphs
- 1 September 1982
- Vol. 12 (3), 323-333
- https://doi.org/10.1002/net.3230120309
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The steiner problem in graphsNetworks, 1971
- On the Efficiency of the Algorithm for Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1970
- Quasi-linearization and upper and lower bounds for variational problemsQuarterly of Applied Mathematics, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956