Jan Höckendorff

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

Tight Bounds for $(1 + ε)$ -Approximation for Minimum Spanning Trees in Doubling Metrics

Jan Höckendorff, Felix Hommelsheim, Christian Sohler +1

The minimum spanning tree (MST) problem is one of the most basic optimization problems on metric spaces and graphs. We study the problem of computing a $(1 + ε)$ -approximation to the…

cs.DS2026

Time Series Decomposition using the Fréchet Distance

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

In this paper, we introduce a new data analysis problem that aims to decompose a set of univariate time series into a small set of $k$ base curves of length at most $l$ such that t…

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…

Tight Bounds for (1+ε)-Approximation for Minimum Spanning Trees in Doubling Metrics

Time Series Decomposition using the Fréchet Distance

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

Tight Bounds for $(1 + ε)$ -Approximation for Minimum Spanning Trees in Doubling Metrics