A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799)

From MaRDI portal
Revision as of 16:12, 15 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
scientific article

    Statements

    A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    rectilinear metric
    0 references
    rectangular convex hull
    0 references
    Steiner minimal tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references