Stochastic submodular probing with state-dependent costs

DOI10.1007/978-3-030-93176-6_15zbMath1503.90121arXiv1909.01795OpenAlexW4206682156MaRDI QIDQ5918731

Shaojie Tang

Publication date: 1 July 2022

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

zbMATH Keywords

knapsack constraintsstate-dependent costsstochastic submodular maximization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Constrained stochastic submodular maximization with state-dependent costs

Cites Work

• 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
• Unnamed Item

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