1 paper
I. Aldana-Galván, J. C. Catana-Salazar, J. M. Díaz-Báñez +5
We study the algorithmic problem of optimally covering a tree with k mobile robots. The tree is known to all robots, and our goal is to assign a walk to each robot in such a way…