The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter (Q4186240): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Fan R. K. Chung / rank
 
Normal rank
Property / author
 
Property / author: Frank K. Hwang / rank
 
Normal rank

Revision as of 19:37, 11 February 2024

scientific article; zbMATH DE number 3623466
Language Label Description Also known as
English
The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter
scientific article; zbMATH DE number 3623466

    Statements

    The largest minimal rectilinear steiner trees for a set of <i>n</i> points enclosed in a rectangle with given perimeter (English)
    0 references
    0 references
    1979
    0 references
    Largest Minimal Rectilinear Steiner Trees
    0 references
    Network Programming
    0 references
    Semiperimeter
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references