Pages that link to "Item:Q4606293"
From MaRDI portal
The following pages link to New algorithms, better bounds, and a novel model for online stochastic matching (Q4606293):
Displaying 18 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)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model (Q2152115) (← links)
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) (← links)
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Improved Bounds for Online Stochastic Matching (Q3586460) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- Stochastic Online Metric Matching (Q5091225) (← links)
- Stochastic Matching with Few Queries: New Algorithms and Tools (Q5236368) (← links)
- Online matching with concave returns (Q5415471) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931) (← links)
- (Q6075951) (← links)
- The power of multiple choices in online stochastic matching (Q6083465) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)