Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints

DOI10.1016/j.tcs.2022.09.022OpenAlexW4300981391MaRDI QIDQ2087465

Shaojie Tang

Publication date: 21 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.04853

zbMATH Keywords

approximation algorithmsnonmonotonicityadaptive submodularity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Streaming adaptive submodular maximization

Cites Work

• Unnamed Item
• Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
• Price of dependence: stochastic submodular maximization with dependent items
• Influence maximization with partial feedback
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• An analysis of approximations for maximizing submodular set functions—I
• Robust Adaptive Submodular Maximization

This page was built for publication: Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints