Pages that link to "Item:Q4636450"
From MaRDI portal
The following pages link to A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching (Q4636450):
Displaying 14 items.
- Online bottleneck semi-matching (Q2150569) (← links)
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) (← links)
- Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
- Online minimum matching with uniform metric and random arrivals (Q2670469) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- Stochastic Online Metric Matching (Q5091225) (← links)
- (Q5091241) (← links)
- Dynamic Relaxations for Online Bipartite Matching (Q5106387) (← links)
- (Q5116527) (← links)
- Deterministic min-cost matching with delays (Q5916084) (← links)
- (Q6062163) (← links)
- Online bottleneck matching on a line (Q6110959) (← links)
- Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (Q6120929) (← links)
