Pages that link to "Item:Q3452763"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for Stochastic Matching (Q3452763):
Displaying 17 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity'', Reykjavík, Iceand, July 2008 (Q983516) (← links)
- Faster and simpler approximation of stable matchings (Q1736612) (← links)
- Improved bounds in stochastic matching and optimization (Q1755741) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Improved Approximation Algorithms for Stochastic Matching (Q3452763) (← links)
- Improved Bounds for Online Stochastic Matching (Q3586460) (← links)
- Exact Bounds for the Stochastic Upward Matching Problem (Q3806444) (← links)
- Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory (Q4376193) (← links)
- Stochastic analysis of partitioning algorithms for matching problems (Q4519111) (← links)
- (Q5136319) (← links)
- Stochastic Matching with Few Queries: New Algorithms and Tools (Q5236368) (← links)
- (Q5875506) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback (Q6161475) (← links)