Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds.
Moses CharikarShay SolomonPublished in: CoRR (2017)
Keyphrases
- worst case
- average case
- upper bound
- lower bound
- error bounds
- matching algorithm
- worst case analysis
- computational complexity
- dynamic environments
- image matching
- data sets
- running times
- upper and lower bounds
- feature matching
- greedy algorithm
- graph matching
- approximation algorithms
- matching process
- convex hull
- lower and upper bounds
- pattern matching
- multiscale
- matching scheme
- learning algorithm
- mistake bound
- database
- complexity bounds