15 citations · 47 across the 17 of their papers we have counts for
3 papers · 1 filter
An improved Lower Bound for Local Failover in Directed Networks via Binary Covering Arrays
Erik van den Akker, Klaus-Tycho Foerster
Communication networks often rely on some form of local failover rules for fast forwarding decisions upon link failures. While on undirected networks, up to two failures can be tol…
Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
Erik van den Akker, Kevin Buchin, Klaus-Tycho Foerster
We study the problem of multi-agent online graph exploration, in which a team of k agents has to explore a given graph, starting and ending on the same node. The graph is initially…
Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs
Sebastian Brandt, Klaus-Tycho Foerster, Jonathan Maurer +1
We study the problem of online graph exploration on undirected graphs, where a searcher has to visit every vertex and return to the origin. Once a new vertex is visited, the search…