In this paper we study the relation of two fundamental problems in sched...
We consider online scheduling on unrelated (heterogeneous) machines in a...
We consider non-clairvoyant scheduling with online precedence constraint...
We introduce a novel measure for quantifying the error in input predicti...
In non-clairvoyant scheduling, the task is to find an online strategy fo...
Exploring unknown environments is a fundamental task in many domains, e....
We study the fundamental online k-server problem in a learning-augmented...
We study the graph parameter elimination distance to bounded degree, whi...