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

From MaRDI portal
Revision as of 20:03, 11 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article; zbMATH DE number 4035172
Language Label Description Also known as
English
A faster approximation algorithm for the Steiner problem in graphs
scientific article; zbMATH DE number 4035172

    Statements

    A faster approximation algorithm for the Steiner problem in graphs (English)
    0 references
    0 references
    1988
    0 references
    approximation algorithm
    0 references
    Steiner tree
    0 references
    distance graph
    0 references

    Identifiers