An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125)

From MaRDI portal
Revision as of 20:00, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
scientific article

    Statements

    An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (English)
    0 references
    0 references
    0 references
    29 October 2008
    0 references
    Euclidean Steiner problem
    0 references
    strong branching
    0 references

    Identifiers