In this paper we study the relation of two fundamental problems in sched...
Learning-augmented algorithms have been attracting increasing interest, ...
We consider non-clairvoyant scheduling with online precedence constraint...
Given subsets of uncertain values, we study the problem of identifying t...
We study how to utilize (possibly erroneous) predictions in a model for
...
Exploring unknown environments is a fundamental task in many domains, e....
Given a hypergraph with uncertain node weights following known probabili...
We study how to utilize (possibly machine-learned) predictions in a mode...
Knapsack problems are among the most fundamental problems in optimizatio...