Hardness and approximation results for packing Steiner trees (Q2369873)

From MaRDI portal
Revision as of 17:07, 3 August 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
Hardness and approximation results for packing Steiner trees
scientific article

    Statements

    Hardness and approximation results for packing Steiner trees (English)
    0 references
    0 references
    0 references
    21 June 2007
    0 references
    packing edge-disjoint Steiner trees of undirected graphs
    0 references
    packing Steiner-node-disjoint Steiner trees of undirected graphs
    0 references

    Identifiers

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