research
∙
07/17/2023
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
In this paper we study the relation of two fundamental problems in sched...
share
research
∙
02/02/2023
Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary
We consider online scheduling on unrelated (heterogeneous) machines in a...
research
∙
01/30/2023
Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints
We consider non-clairvoyant scheduling with online precedence constraint...
research
∙
05/25/2022
A Universal Error Measure for Input Predictions Applied to Online Graph Problems
We introduce a novel measure for quantifying the error in input predicti...
research
∙
02/21/2022
Non-Clairvoyant Scheduling with Predictions Revisited
In non-clairvoyant scheduling, the task is to find an online strategy fo...
research
∙
12/10/2021
Robustification of Online Graph Exploration Methods
Exploring unknown environments is a fundamental task in many domains, e....
research
∙
03/02/2021
Double Coverage with Machine-Learned Advice
We study the fundamental online k-server problem in a learning-augmented...
research
∙
07/05/2020
