An O(n log n) algorithm for suboptimal rectilinear Steiner trees (Q4174637)

From MaRDI portal
Revision as of 11:55, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    Suboptimal Rectilinear Steiner Tree Algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references