Convexity and the Steiner tree problem
- 1 March 1988
- Vol. 18 (1) , 55-72
- https://doi.org/10.1002/net.3230180108
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Send-and-Split Method for Minimum-Concave-Cost Network FlowsMathematics of Operations Research, 1987
- Steiner minimal tree for points on a circleProceedings of the American Mathematical Society, 1985
- Steiner Trees for LaddersPublished by Elsevier ,1978
- Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 1977
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The steiner problem in graphsNetworks, 1971
- On the Efficiency of the Algorithm for Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1970
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961