research
∙
04/04/2023
Mixing predictions for online metric algorithms
A major technique in learning-augmented online algorithms is combining m...
share
research
∙
10/06/2022
Paging with Succinct Predictions
Paging is a prototypical problem in the area of online algorithms. It ha...
research
∙
12/17/2021
An Exact Algorithm for the Linear Tape Scheduling Problem
Magnetic tapes are often considered as an outdated storage technology, y...
research
∙
10/25/2021
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
We study the online problem of minimizing power consumption in systems w...
research
∙
03/02/2021
Double Coverage with Machine-Learned Advice
We study the fundamental online k-server problem in a learning-augmented...
research
∙
11/10/2020
Speed-Robust Scheduling
The speed-robust scheduling problem is a two-stage problem where given m...
research
∙
07/16/2020
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time
Knapsack problems are among the most fundamental problems in optimizatio...
research
∙
03/12/2020
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics
We consider the problem of computing a Steiner tree of minimum cost unde...
research
∙
03/04/2020
Online metric algorithms with untrusted predictions
Machine-learned predictors, although achieving very good results for inp...
research
∙
01/04/2020
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem
There are several problems in the theory of online computation where tig...
research
∙
12/19/2019
Energy Minimization in DAG Scheduling on MPSoCs at Run-Time: Theory and Practice
Static (offline) techniques for mapping applications given by task graph...
research
∙
12/06/2019
Scheduling on Hybrid Platforms: Improved Approximability Window
Modern platforms are using accelerators in conjunction with standard pro...
research
∙
09/25/2019