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

From MaRDI portal
Revision as of 19:37, 11 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q224543)
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
    Suboptimal Rectilinear Steiner Tree Algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references