2 citations · 2 across the 14 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
Romain Cosson, Laurent Massoulié
We study the problem of collective tree exploration in which a team of mobile agents must collectively visit all nodes of an unknown tree in as few moves as possible. The agent…
cs.DS2024
Barely Random Algorithms and Collective Metrical Task Systems
Romain Cosson, Laurent Massoulié
We consider metrical task systems on general metric spaces with points, and show that any fully randomized algorithm can be turned into a randomized algorithm that uses only $2…
cs.DS2023
Collective Tree Exploration via Potential Function Method
Romain Cosson, Laurent Massoulié
We study the problem of collective tree exploration (CTE) where a team of agents is tasked to traverse all the edges of an unknown tree as fast as possible, assuming complete c…