Stochastic submodular probing with state-dependent costs

DOI10.1016/j.tcs.2022.09.030OpenAlexW2971967224MaRDI QIDQ5918543

Shaojie Tang

Publication date: 24 October 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.09.030

zbMATH Keywords

knapsack constraintsstate-dependent costsstochastic submodular maximization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Submodular Stochastic Probing on Matroids
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Combinatorial Prophet Inequalities
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits

This page was built for publication: Stochastic submodular probing with state-dependent costs