2 citations · 5 across the 17 of their papers we have counts for
3 papers · 1 filter
Learning-Augmented Online Scheduling with Parsimonious Preemption
Mugen Blue, Sungjin Im, Alexander Lindermayr
Learning-augmented algorithms have emerged as a powerful paradigm to surpass traditional worst-case lower bounds by integrating potentially noisy predictions. While this framework…
Robustification of Online Graph Exploration Methods
Franziska Eberle, Alexander Lindermayr, Nicole Megow +2
Exploring unknown environments is a fundamental task in many domains, e.g., robot navigation, network security, and internet search. We initiate the study of a learning-augmented v…
Double Coverage with Machine-Learned Advice
Alexander Lindermayr, Nicole Megow, Bertrand Simon
We study the fundamental online k-server problem in a learning-augmented setting. While in the traditional online model, an algorithm has no information about the request sequence,…