Pages that link to "Item:Q897954"
From MaRDI portal
The following pages link to Near optimal algorithms for online maximum edge-weighted \(b\)-matching and two-sided vertex-weighted \(b\)-matching (Q897954):
Displaying 9 items.
- An optimal deterministic algorithm for online \(b\)-matching (Q1575950) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- Dispatch: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q1757767) (← links)
- Learn from history for online bipartite matching (Q2091114) (← links)
- Online generalized assignment problem with historical information (Q2108140) (← links)
- Online crowdsourced truck delivery using historical information (Q2140193) (← links)
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals (Q2187342) (← links)
- Online Bipartite Matching with Decomposable Weights (Q2921410) (← links)
- (Q5002758) (← links)