A Tight Bound for Stochastic Submodular Cover
From MaRDI portal
Recommendations
- Revisiting the approximation bound for stochastic submodular cover
- Stochastic submodular cover with limited adaptivity
- On approximation of the submodular set cover problem
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
- Approximating subdense instances of covering problems
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- Tight bounds on subexponential time approximation of set cover and related problems
- A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
Cites work
- A threshold of ln n for approximating set cover
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- An analysis of the greedy algorithm for the submodular set covering problem
- Analytical approach to parallel repetition
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- 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”
- Greedy approximations for minimum submodular cover with submodular cost
- scientific article; zbMATH DE number 6783452 (Why is no real title available?)
- Revisiting the approximation bound for stochastic submodular cover
- Stochastic Covering and Adaptivity
Cited in
(10)- Tight bounds for double coverage against weak adversaries
- The stochastic Boolean function evaluation problem for symmetric Boolean functions
- Tight Bounds for Double Coverage Against Weak Adversaries
- Approximation algorithms for stochastic submodular set cover with applications to Boolean function evaluation and min-knapsack
- Revisiting the approximation bound for stochastic submodular cover
- Stochastic submodular cover with limited adaptivity
- Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
- The power of adaptivity for stochastic submodular cover
- Identifying approximate minimizers under stochastic uncertainity
- Non-adaptive evaluation of k-of-n functions: tight gap and a unit-cost PTAS
This page was built for publication: A Tight Bound for Stochastic Submodular Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009701)
