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
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Fan R. K. Chung / rank
Normal rank
 
Property / author
 
Property / author: Frank K. Hwang / rank
Normal rank
 
Property / author
 
Property / author: Fan R. K. Chung / rank
 
Normal rank
Property / author
 
Property / author: Frank K. Hwang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.3230090103 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075081396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner trees for bounded point sets / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:40, 13 June 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
    0 references