Jan Höckendorff

collaborators

2 papers

cs.DS2025

A near-linear time approximation scheme for $(k, ℓ)$ -median clustering under discrete Fréchet distance

Anne Driemel, Jan Höckendorff, Ioannis Psarros +1

A time series of complexity $m$ is a sequence of $m$ real valued measurements. The discrete Fréchet distance $d_{d F} (x, y)$ is a distance measure between two time series $x$ and $y$ …

cs.DS2023

Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs

Lukas Drexler, Jan Höckendorff, Joshua Könen +1

We consider the following natural problem that generalizes min-sum-radii clustering: Given is $k \in N$ as well as some metric space $(V, d)$ where $V = F \cup C$ for facilities…

A near-linear time approximation scheme for (k,ℓ)-median clustering under discrete Fréchet distance

Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs

A near-linear time approximation scheme for $(k, ℓ)$ -median clustering under discrete Fréchet distance