A Tight Bound for Stochastic Submodular Cover

DOI10.1613/jair.1.12368OpenAlexW3127539712MaRDI QIDQ5009701

Devorah Kletenik, Srinivasan Parthasarathy, Lisa Hellerstein

Publication date: 5 August 2021

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

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

zbMATH Keywords

uncertaintymathematical foundations

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

The stochastic Boolean function evaluation problem for symmetric Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of the greedy algorithm for the submodular set covering problem
• Greedy approximations for minimum submodular cover with submodular cost
• Minimum Latency Submodular Cover
• A threshold of ln n for approximating set cover
• Stochastic Covering and Adaptivity
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in “Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations”
• Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
• Revisiting the Approximation Bound for Stochastic Submodular Cover
• Analytical approach to parallel repetition

This page was built for publication: A Tight Bound for Stochastic Submodular Cover