An SST‐based algorithm for the steiner problem in graphs
- 1 January 1989
- Vol. 19 (1), 1-16
- https://doi.org/10.1002/net.3230190102
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Problem reduction methods and a tree generation algorithm for the steiner network problemNetworks, 1987
- The node‐weighted steiner tree problemNetworks, 1987
- Network decomposition for the optimization of connection structuresNetworks, 1986
- An Applications Oriented Guide to Lagrangian RelaxationInforms Journal on Applied Analytics, 1985
- An algorithm for the steiner problem in graphsNetworks, 1984
- An integer linear programming approach to the steiner problem in graphsNetworks, 1980
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- 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