Pages that link to "Item:Q3638040"
From MaRDI portal
The following pages link to Approximating Matches Made in Heaven (Q3638040):
Displaying 23 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (Q692633) (← links)
- On the adaptivity gap of stochastic orienteering (Q896283) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Improved analysis of the greedy algorithm for stochastic matching (Q1944124) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Almost exact matchings (Q2429356) (← links)
- Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
- As Close as It Gets (Q2803825) (← links)
- Submodular Stochastic Probing on Matroids (Q3186541) (← links)
- Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
- Technical Note—Assortment Planning for Two-Sided Sequential Matching Markets (Q5058044) (← links)
- Stochastic graph exploration (Q5092339) (← links)
- Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries (Q5130481) (← links)
- (Q5136319) (← links)
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering (Q5245015) (← links)
- (Q5743496) (← links)
- (Q5875506) (← links)
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback (Q6161475) (← links)
- Stochastic Probing with Increasing Precision (Q6187078) (← links)
