Improving update times of dynamic matching algorithms from amortized to worst case.
Peter KissPublished in: CoRR (2021)
Keyphrases
- worst case
- running times
- average case
- error bounds
- learning algorithm
- matching algorithm
- orders of magnitude
- theoretical analysis
- upper bound
- space complexity
- significant improvement
- lower bound
- computationally efficient
- matching process
- approximation algorithms
- greedy algorithm
- computational complexity
- combinatorial optimization
- image matching
- times faster
- np hard
- data structure
- online algorithms
- data mining
- mistake bound