2 papers
cs.DS2024
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…
cs.PF2024
Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster +2
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the…