On the Hardness of Computing an Average Curve.

DOI10.4230/lipics.swat.2020.19arXiv1902.08053OpenAlexW3037127288MaRDI QIDQ6059183

Martijn Struijs, Kevin Buchin, Anne Driemel

Publication date: 2 November 2023

Full work available at URL: https://arxiv.org/abs/1902.08053

zbMATH Keywords

algorithmsclusteringapproximationcurveshardness

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Approximating ( k,ℓ )-Median Clustering for Polygonal Curves ⋮ Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance ⋮ Approximating length-restricted means under dynamic time warping ⋮ Tight Hardness Results for Consensus Problems on Circular Strings and Time Series

This page was built for publication: On the Hardness of Computing an Average Curve.