Pages that link to "Item:Q3186541"
From MaRDI portal
The following pages link to Submodular Stochastic Probing on Matroids (Q3186541):
Displaying 15 items.
- Robust budget allocation via continuous submodular functions (Q2019911) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Price of dependence: stochastic submodular maximization with dependent items (Q2292144) (← links)
- Mining order-preserving submatrices from probabilistic matrices (Q2943568) (← links)
- Submodular Stochastic Probing on Matroids (Q2965469) (← links)
- (Q5002731) (← links)
- (Q5136319) (← links)
- Submodular Maximization with Uncertain Knapsack Capacity (Q5232144) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- Stochastic submodular probing with state-dependent costs (Q5918543) (← links)
- Stochastic submodular probing with state-dependent costs (Q5918731) (← links)
- Query minimization under stochastic uncertainty (Q5925528) (← links)
- Maximizing stochastic set function under a matroid constraint from decomposition (Q6621839) (← links)
- On submodular prophet inequalities and correlation gap (Q6633573) (← links)