A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658)

From MaRDI portal
Revision as of 10:02, 21 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
A note on maximizing a submodular set function subject to a knapsack constraint
scientific article

    Statements

    A note on maximizing a submodular set function subject to a knapsack constraint (English)
    0 references
    0 references
    1 July 2004
    0 references
    Submodular function
    0 references
    Approximation algorithm
    0 references

    Identifiers