Pages that link to "Item:Q2006938"
From MaRDI portal
The following pages link to Online stochastic matching: new algorithms and bounds (Q2006938):
Displaying 19 items.
- 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)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Improved online algorithms for jumbled matching (Q2295624) (← links)
- Online minimum matching with uniform metric and random arrivals (Q2670469) (← links)
- Online stochastic matching: online actions based on offline statistics (Q2925346) (← links)
- The Power of Rejection in Online Bottleneck Matching (Q2942414) (← links)
- Improved Bounds for Online Stochastic Matching (Q3586460) (← links)
- New algorithms, better bounds, and a novel model for online stochastic matching (Q4606293) (← links)
- (Q4607945) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← links)
- Stochastic Matching with Few Queries: New Algorithms and Tools (Q5236368) (← links)
- Online matching with concave returns (Q5415471) (← links)
- Approximation and Online Algorithms (Q5896931) (← links)
- Online 2-stage stable matching (Q6069183) (← links)
- (Q6075951) (← links)
- The power of multiple choices in online stochastic matching (Q6083465) (← links)
- Improved competitive ratio for edge-weighted online stochastic matching (Q6609171) (← links)
- Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)
