Streaming submodular maximization with the chance constraint (Q6166877): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation with a fixed number of solutions of some multiobjective maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming Algorithms for Submodular Function Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-way communication complexity of submodular maximization with applications to streaming and robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting structure of chance constrained programs via submodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided tour of Chernoff bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A One-Sided Inequality of the Chebyshev Type / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-submodular maximization on massive data streams / rank
 
Normal rank

Latest revision as of 11:42, 2 August 2024

scientific article; zbMATH DE number 7722391
Language Label Description Also known as
English
Streaming submodular maximization with the chance constraint
scientific article; zbMATH DE number 7722391

    Statements

    Streaming submodular maximization with the chance constraint (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2023
    0 references
    submodular maximization
    0 references
    streaming algorithm
    0 references
    chance constraint
    0 references
    0 references
    0 references

    Identifiers