Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (Q3120785)

From MaRDI portal
Revision as of 01:38, 17 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129034108, #quickstatements; #temporary_batch_1723853789000)
scientific article
Language Label Description Also known as
English
Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
scientific article

    Statements

    Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2019
    0 references
    maximum-weight connected subgraph problem
    0 references
    prize-collecting Steiner tree problem
    0 references
    reduction techniques
    0 references
    rooted prize-collecting Steiner tree problem
    0 references
    Steiner tree problem
    0 references
    Steiner tree reductions
    0 references
    0 references
    0 references

    Identifiers