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

From MaRDI portal
Revision as of 01:41, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    distance graph
    0 references
    generalized minimum spanning tree
    0 references