An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518)

From MaRDI portal
Revision as of 20:48, 31 July 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
An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties
scientific article

    Statements

    An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (English)
    0 references
    0 references
    10 May 2022
    0 references
    generalized prize-collecting Steiner forest problem
    0 references
    submodular function
    0 references
    primal-dual algorithm
    0 references

    Identifiers