Pages that link to "Item:Q5244859"
From MaRDI portal
The following pages link to Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859):
Displaying 39 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- Online spatio-temporal matching in stochastic and dynamic domains (Q1648078) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- A polyhedral approach to online bipartite matching (Q1801015) (← links)
- Online stochastic matching: new algorithms and bounds (Q2006938) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Online total bipartite matching problem (Q2136880) (← links)
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model (Q2152115) (← 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)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising (Q2699027) (← links)
- The Power of Rejection in Online Bottleneck Matching (Q2942414) (← links)
- A Polyhedral Approach to Online Bipartite Matching (Q3186510) (← links)
- Improved Bounds for Online Stochastic Matching (Q3586460) (← links)
- (Q4607945) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- Greedy Bipartite Matching in Random Type Poisson Arrival Model (Q5009497) (← links)
- Dynamic Stochastic Matching Under Limited Time (Q5106373) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← links)
- On Matching and Thickness in Heterogeneous Dynamic Markets (Q5129171) (← links)
- Stochastic Matching with Few Queries: New Algorithms and Tools (Q5236368) (← links)
- Online matching with concave returns (Q5415471) (← links)
- (Q5743510) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931) (← links)
- Online 2-stage stable matching (Q6069183) (← links)
- (Q6075951) (← links)
- Online stochastic weighted matching algorithm for real‐time shared parking (Q6080597) (← links)
- The power of multiple choices in online stochastic matching (Q6083465) (← links)
- Edge-weighted online bipartite matching (Q6551261) (← links)
- Adwords in a panorama (Q6562830) (← links)
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue (Q6602240) (← links)
- Improved competitive ratio for edge-weighted online stochastic matching (Q6609171) (← links)
- Two-sided capacitated submodular maximization in gig platforms (Q6609176) (← links)