Distributed asynchronous robot teams can explore any tree in 2n + O(k^2 2^k D) moves, and no asynchronous algorithm can beat competitive ratio Ω(log^2 k).
The randomized k-server conjecture is false! In Proceedings of the 55th Annual ACM Symposium on Theory of Computing , pages 581--594, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
Distributed asynchronous robot teams can explore any tree in 2n + O(k^2 2^k D) moves, and no asynchronous algorithm can beat competitive ratio Ω(log^2 k).