The largest minimal rectilinear steiner trees for a set ofn points enclosed in a rectangle with given perimeter
- 1 March 1979
- Vol. 9 (1) , 19-36
- https://doi.org/10.1002/net.3230090103
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- The Complexity of Computing Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1977
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966