4 papers
Connected Subspace Clustering: Hardness, a Scalable Heuristic, and an Application to Sea Level Geodesy
Johanna Hillebrand, Jan Höckendorff, Jürgen Kusche +5
Constrained optimization extends classical optimization by integrating side information, making it widely applicable across scientific and engineering domains. Consider a setting w…
A Fast and Simple -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 -approximation to the…
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 base curves of length at most such that t…
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 as well as some metric space where for facilities…