Pages that link to "Item:Q2187342"
From MaRDI portal
The following pages link to An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342):
Displaying 5 items.
- Dispatch: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q1757767) (← links)
- Online total bipartite matching problem (Q2136880) (← links)
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (Q4575807) (← links)
- (Q5116527) (← links)
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order (Q5363004) (← links)