The following pages link to (Q4607945):
Displaying 14 items.
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Online minimum matching with uniform metric and random arrivals (Q2670469) (← links)
- Markovian online matching algorithms on large bipartite random graphs (Q2684964) (← links)
- Improved Bounds for Online Preemptive Matching (Q2957900) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- (Q5077148) (← links)
- Stochastic Online Metric Matching (Q5091225) (← links)
- (Q5875458) (← links)
- Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6138832) (← links)
- Online Matching in Regular Bipartite Graphs with Randomized Adversary (Q6163632) (← links)
- Online Edge Coloring via Tree Recurrences and Correlation Decay (Q6203478) (← links)
- Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6535803) (← links)
- Improved competitive ratio for edge-weighted online stochastic matching (Q6609171) (← links)