Pages that link to "Item:Q4962618"
From MaRDI portal
The following pages link to Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack (Q4962618):
Displayed 14 items.
- Submodular goal value of Boolean functions (Q1701106) (← links)
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- The stochastic Boolean function evaluation problem for symmetric Boolean functions (Q2065798) (← links)
- Algorithms for the unit-cost stochastic score classification problem (Q2088594) (← links)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
- Sequential testing in batches (Q2399312) (← links)
- Scenario Submodular Cover (Q2971162) (← links)
- (Q4558569) (← links)
- (Q5009596) (← links)
- A Tight Bound for Stochastic Submodular Cover (Q5009701) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- (Q5136319) (← links)
- Adaptivity gaps for the stochastic Boolean function evaluation problem (Q6176559) (← links)