Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546)

From MaRDI portal
Revision as of 11:37, 29 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
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
scientific article

    Statements

    Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2022
    0 references
    submodular maximization
    0 references
    continuous greedy
    0 references
    distributive lattices
    0 references
    median complex
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers