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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 12:50, 6 February 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
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Suboptimal Rectilinear Steiner Tree Algorithm
    0 references