English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability

MPS-Authors
/persons/resource/persons44182

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

/persons/resource/persons44857

Künnemann,  Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons228472

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

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Künnemann, M., & Nusser, A. (2019). Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2902-2921). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975482.180.


Cite as: http://hdl.handle.net/21.11116/0000-0002-9E29-F
Abstract
There is no abstract available