Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm.

Enoch Peserico Michele Scquizzato

Published in: CoRR (2020)

Keyphrases

string matching
worst case
data sets
significant improvement
dynamic programming
optimization algorithm
image segmentation
search space
keypoints
convergence rate
graph matching