Optimal Algorithms for Online b-Matching with Variable Vertex Capacities.
Susanne AlbersSebastian SchubertPublished in: APPROX-RANDOM (2021)
Keyphrases
- worst case
- orders of magnitude
- online learning
- approximately optimal
- computationally efficient
- significant improvement
- computational cost
- optimization problems
- data mining
- evolutionary algorithm
- theoretical analysis
- machine learning algorithms
- optimal solution
- online algorithms
- learning algorithm
- dynamic programming
- data mining techniques
- convergence rate
- stereo correspondence
- binary search trees