Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
Thomas Erlebach, Kelin Luo, Wen Zhang
Given a fleet of drones with different speeds and a set of package delivery requests, the collaborative delivery problem asks for a schedule for the drones to collaboratively carry…
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…
cs.DS2025
Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
Matthias Kaul, Kelin Luo, Matthias Mnich +1
We study the problem of partitioning a set of objects in a metric space into clusters . The quality of the clustering is measured by considering the vector o…