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
∙
06/14/2023
Recoverable Robust Optimization with Commitment
We propose a model for recoverable robust optimization with commitment. ...
research
∙
05/16/2023
Sorting and Hypergraph Orientation under Uncertainty with Predictions
Learning-augmented algorithms have been attracting increasing interest, ...
research
∙
04/27/2023
On Solution Discovery via Reconfiguration
The dynamics of real-world applications and systems require efficient me...
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
∙
11/03/2022
Matching Augmentation via Simultaneous Contractions
We consider the matching augmentation problem (MAP), where a matching of...
research
∙
11/02/2022
Set Selection under Explorable Stochastic Uncertainty via Covering Techniques
Given subsets of uncertain values, we study the problem of identifying t...
research
∙
08/29/2022
Configuration Balancing for Stochastic Requests
The configuration balancing problem with stochastic requests generalizes...
research
∙
06/30/2022
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty
We study how to utilize (possibly erroneous) predictions in a model for ...
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
∙
07/01/2021
Orienting (hyper)graphs under explorable stochastic uncertainty
Given a hypergraph with uncertain node weights following known probabili...
research
∙
03/02/2021
Double Coverage with Machine-Learned Advice
We study the fundamental online k-server problem in a learning-augmented...
research
∙
11/14/2020
Untrusted Predictions Improve Trustable Query Policies
We study how to utilize (possibly machine-learned) predictions in a mode...
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
∙
01/09/2020
Online Minimum Cost Matching on the Line with Recourse
In online minimum cost matching on the line, n requests appear one by on...
research
∙
12/23/2019
Optimally handling commitment issues in online throughput maximization
We consider a fundamental online scheduling problem in which jobs with p...
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
∙
11/30/2018
Optimal Algorithms for Scheduling under Time-of-Use Tariffs
We consider a natural generalization of classical scheduling problems in...
research
∙
11/20/2018