An Improved Program for the Full Steiner Tree Problem
- 1 December 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 3 (4), 359-385
- https://doi.org/10.1145/355759.355764
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the Efficiency of the Algorithm for Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- Computation of minimal length full Steiner trees on the vertices of a convex polygonMathematics of Computation, 1969
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- On the Steiner ProblemCanadian Mathematical Bulletin, 1967
- Generation of permutations by adjacent transpositionMathematics of Computation, 1963
- On the Problem of SteinerCanadian Mathematical Bulletin, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957