Tight Bounds for Approximate Near Neighbor Searching for Time Series under the 
Fréchet Distance

Bringmann, Karl; Driemel, Anne; Nusser, André; Psarros, Ioannis

doi:10.1137/1.9781611977073.25

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons228472

Nusser, André
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Driemel, A., Nusser, A., & Psarros, I. (2022). Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance. In S. Naor, & N. Buchbinder (Eds.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 517-550). Philadephia, PA: SIAM. doi:10.1137/1.9781611977073.25.

Cite as: https://hdl.handle.net/21.11116/0000-000C-1D7D-9

Abstract

There is no abstract available