Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (Q2353460)

From MaRDI portal
Revision as of 12:04, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
scientific article

    Statements

    Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2015
    0 references
    set cover
    0 references
    submodular cost
    0 references
    penalties
    0 references
    approximation algorithm
    0 references
    primal-dual
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers