A faster approximation algorithm for the Steiner problem in graphs (Q5903117)

From MaRDI portal
Revision as of 10:20, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3952028
Language Label Description Also known as
English
A faster approximation algorithm for the Steiner problem in graphs
scientific article; zbMATH DE number 3952028

    Statements

    A faster approximation algorithm for the Steiner problem in graphs (English)
    0 references
    1986
    0 references
    Steiner tree
    0 references
    distance graph
    0 references
    generalized minimum spanning tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references