5 citations · 5 across the 4 of their papers we have counts for
Showing 2025 · cs.DSShow all
2 papers · 2 filters
cs.DS2025
New Algorithms and Hardness Results for Connected Clustering
Jan Eube, Heiko Röglin
Connected clustering denotes a family of constrained clustering problems in which we are given a distance metric and an undirected connectivity graph that can be completely unr…
cs.DS2025
Connected k-Median with Disjoint and Non-disjoint Clusters
Jan Eube, Kelin Luo, Dorian Reineccius +2
The connected -median problem is a constrained clustering problem that combines distance-based -clustering with connectivity information. The problem allows to input a metric…