3 papers
cs.DS2025
The Buffer Minimization Problem for Scheduling Flow Jobs with Conflicts
Niklas Haas, Sören Schmitt, Rob van Stee
We consider the online buffer minimization in multiprocessor systems with conflicts problem (in short, the buffer minimization problem) in the recently introduced flow model. In an…
cs.DS2024
Improved online load balancing with known makespan
Martin Böhm, Matej Lieskovský, Sören Schmitt +2
We break the barrier of for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, identical machines and the optimal ma…
cs.DM2019
Evacuating Two Robots from a Disk: A Second Cut
Yann Disser, Sören Schmitt
We present an improved algorithm for the problem of evacuating two robots from the unit disk via an unknown exit on the boundary. Robots start at the center of the disk, move at un…