Streaming submodular maximization with the chance constraint

DOI10.1007/978-3-031-20796-9_10zbMath1524.90268MaRDI QIDQ6166877

Qizhi Fang, Bin Liu, Shufang Gong

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

zbMATH Keywords

submodular maximizationchance constraintstreaming algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation with a fixed number of solutions of some multiobjective maximization problems
• A guided tour of Chernoff bounds
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
• Exploiting structure of chance constrained programs via submodularity
• Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity
• Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• Non-submodular maximization on massive data streams
• A threshold of ln n for approximating set cover
• Streaming Algorithms for Submodular Function Maximization
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Gadgets, Approximation, and Linear Programming
• The one-way communication complexity of submodular maximization with applications to streaming and robustness
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• A One-Sided Inequality of the Chebyshev Type
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint

This page was built for publication: Streaming submodular maximization with the chance constraint