Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (Q2191293)

From MaRDI portal
Revision as of 11:57, 1 August 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
Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
scientific article

    Statements

    Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2020
    0 references
    streaming
    0 references
    non-submodular
    0 references
    \(d\)-knapsack constraint
    0 references

    Identifiers