Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438)

From MaRDI portal
Revision as of 01:05, 5 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
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
scientific article

    Statements

    Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2012
    0 references
    non-monotone submodular set functions
    0 references
    approximation algorithms
    0 references
    continuous greedy process
    0 references
    matroid
    0 references
    knapsack
    0 references
    cardinality
    0 references

    Identifiers