1 citations · 1 across the 7 of their papers we have counts for
1 paper · 1 filter
Niv Buchbinder, Anupam Gupta, Daniel Hathcock +2
Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A bre…