A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030)

From MaRDI portal
Revision as of 11:03, 21 June 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 tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem
scientific article

    Statements

    A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tight worst case upper bound
    0 references
    heuristics
    0 references
    minimum rectilinear Steiner tree problem
    0 references