25 citations · 57 across the 24 of their papers we have counts for
4 papers · 1 filter
Energy-efficient Delivery by Heterogeneous Mobile Agents
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +4
We consider the problem of delivering messages between specified source-target pairs in a weighted undirected graph, by mobile agents initially located at distinct nodes of…
A general lower bound for collaborative tree exploration
Yann Disser, Frank Mousset, Andreas Noever +2
We consider collaborative graph exploration with a set of agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other ver…
Collaborative Delivery with Energy-Constrained Mobile Robots
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +5
We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a l…
Hiring Secretaries over Time: The Benefit of Concurrent Employment
Yann Disser, John Fearnley, Martin Gairing +5
We consider a stochastic online problem where applicants arrive over time, one per time step. Upon arrival of each applicant their cost per time step is revealed, and we have t…