Some generalizations of the steiner problem in graphs
- 1 January 1987
- Vol. 17 (3), 353-364
- https://doi.org/10.1002/net.3230170309
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The node‐weighted steiner tree problemNetworks, 1987
- On finding steiner verticesNetworks, 1986
- Network decomposition for the optimization of connection structuresNetworks, 1986
- A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 1984
- An algorithm for the steiner problem in graphsNetworks, 1984
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Reducibility among Combinatorial ProblemsPublished by Springer Science and Business Media LLC ,1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957