Login / Signup

DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.

Minjun ChangDorit S. HochbaumQuico SpaenMark Velednitsky
Published in: WAOA (2018)
Keyphrases
  • computational complexity
  • bipartite matching
  • objective function
  • worst case
  • cost function
  • optimal solution
  • knapsack problem
  • lower bound
  • search space
  • multi objective
  • dynamic programming
  • benchmark problems