An O(n log n) algorithm for suboptimal rectilinear Steiner trees (Q4174637): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Latest revision as of 15:36, 5 March 2024

scientific article; zbMATH DE number 3609582
Language Label Description Also known as
English
An O(n log n) algorithm for suboptimal rectilinear Steiner trees
scientific article; zbMATH DE number 3609582

    Statements

    An O(n log n) algorithm for suboptimal rectilinear Steiner trees (English)
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Suboptimal Rectilinear Steiner Tree Algorithm
    0 references
    0 references