Stochastic Submodular Cover with Limited Adaptivity

DOI10.1137/1.9781611975482.21zbMath1431.90122arXiv1810.13351OpenAlexW2951471734MaRDI QIDQ5236202

Sanjeev Khanna, Arpit Agarwal, Sepehr Assadi

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (3)

Set selection under explorable stochastic uncertainty via covering techniques ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint

This page was built for publication: Stochastic Submodular Cover with Limited Adaptivity