@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}
}