Pages that link to "Item:Q692633"
From MaRDI portal
The following pages link to When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633):
Displaying 19 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Non-adaptive stochastic score classification and explainable halfspace evaluation (Q2164705) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
- Stochastic Unsplittable Flows (Q5002608) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries (Q5130481) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- (Q5136319) (← links)
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
- (Q5875506) (← links)
- Stochastic Probing with Increasing Precision (Q6187078) (← links)
