A faster algorithm for the Fr\'echet distance in 1D for the imbalanced
case
A faster algorithm for the Fr\'echet distance in 1D for the imbalanced
case
The fine-grained complexity of computing the Fr\'echet distance has been a topic of much recent work, starting with the quadratic SETH-based conditional lower bound by Bringmann from 2014. Subsequent work established largely the same complexity lower bounds for the Fr\'echet distance in 1D. However, the imbalanced case, which was shown …