The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

Networks

Volumn 9, Issue 1, 1979, Pages 19-36

  Chung, F R K ^a   Hwang, F K ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES;

STEINER TREES;

PRINTED CIRCUITS;

EID: 0018440271     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230090103     Document Type: Article

References (5)

1. The Rectilinear Steiner Tree Problem is NP‐Complete
2. On Steiner's Problem with Rectilinear Distances