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

DOI10.1007/978-3-030-92666-3_2MaRDI QIDQ6629012zbMATH OpenFDO

Authors Shaojie Tang

Publication date 29 October 2024

Full work available at URL https://doi.org/10.1007/978-3-030-92666-3_2

zbMATH Keywords

adaptive submodularityapproximation algorithmsnon-monotonicity

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
• Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
• Non-monotone submodular maximization under matroid and knapsack constraints
• Maximizing nonmonotone submodular functions under matroid or knapsack constraints

Cites work

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

Cited in

(2)

• Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
• Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629012)