1 citations · 2 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
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…
cs.DS2021
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…