Published in: LIPIcs, Volume 293, 40th International Symposium on Computational Geometry (SoCG 2024)
Jacobus Conradi, Benedikt Kolbe, Ioannis Psarros, and Dennis Rohde. Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping. In 40th International Symposium on Computational Geometry (SoCG 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 293, pp. 42:1-42:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{conradi_et_al:LIPIcs.SoCG.2024.42, author = {Conradi, Jacobus and Kolbe, Benedikt and Psarros, Ioannis and Rohde, Dennis}, title = {{Fast Approximations and Coresets for (k,𝓁)-Median Under Dynamic Time Warping}}, booktitle = {40th International Symposium on Computational Geometry (SoCG 2024)}, pages = {42:1--42:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-316-4}, ISSN = {1868-8969}, year = {2024}, volume = {293}, editor = {Mulzer, Wolfgang and Phillips, Jeff M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.42}, URN = {urn:nbn:de:0030-drops-199875}, doi = {10.4230/LIPIcs.SoCG.2024.42}, annote = {Keywords: Dynamic time warping, coreset, median clustering, approximation algorithm} }
Published in: LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Frederik Brüning, Jacobus Conradi, and Anne Driemel. Faster Approximate Covering of Subcurves Under the Fréchet Distance. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bruning_et_al:LIPIcs.ESA.2022.28, author = {Br\"{u}ning, Frederik and Conradi, Jacobus and Driemel, Anne}, title = {{Faster Approximate Covering of Subcurves Under the Fr\'{e}chet Distance}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.28}, URN = {urn:nbn:de:0030-drops-169660}, doi = {10.4230/LIPIcs.ESA.2022.28}, annote = {Keywords: Clustering, Set cover, Fr\'{e}chet distance, Approximation algorithms} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Jacobus Conradi and Anne Driemel. On Computing the k-Shortcut Fréchet Distance. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 46:1-46:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{conradi_et_al:LIPIcs.ICALP.2022.46, author = {Conradi, Jacobus and Driemel, Anne}, title = {{On Computing the k-Shortcut Fr\'{e}chet Distance}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {46:1--46:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.46}, URN = {urn:nbn:de:0030-drops-163875}, doi = {10.4230/LIPIcs.ICALP.2022.46}, annote = {Keywords: Fr\'{e}chet distance, Partial similarity, Conditional lower bounds, Approximation algorithms} }