10 citations · 31 across the 24 of their papers we have counts for
4 papers · 1 filter
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…
On Complexity of 1-Center in Various Metrics
Amir Abboud, Mohammad Hossein Bateni, Vincent Cohen-Addad +2
We consider the classic 1-center problem: Given a set of points in a metric space find the point in that minimizes the maximum distance to the other points of . We s…
Orienting (hyper)graphs under explorable stochastic uncertainty
Evripidis Bampis, Christoph Dürr, Thomas Erlebach +3
Given a hypergraph with uncertain node weights following known probability distributions, we study the problem of querying as few nodes as possible until the identity of a node wit…
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,…