Matthias Kaul

collaborators

2 papers

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 $n$ objects in a metric space into $k$ clusters $V_{1}, \dots, V_{k}$ . The quality of the clustering is measured by considering the vector o…

cs.DS2024

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates

Matthias Kaul, Matthias Mnich, Hendrik Molter

We study the fundamental scheduling problem $1 ∣ r_{j} ∣ \sum w_{j} U_{j}$ : schedule a set of $n$ jobs with weights, processing times, release dates, and due dates on a single machine…