The freeze-tag problem: How to wake up a swarm of robots
From MaRDI portal
Publication:850797
DOI10.1007/s00453-006-1206-1zbMath1101.68098arXivcs/0402045OpenAlexW3136433167MaRDI QIDQ850797
Michael A. Bender, Sándor P. Fekete, Esther M. Arkin, Joseph S. B. Mitchell, Martin Skutella
Publication date: 6 November 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0402045
Related Items (7)
Traveling salesmen in the presence of competition ⋮ Broadcasting a file in a communication network ⋮ A PTAS for geometric 2-FTP ⋮ Cooperative TSP ⋮ Black hole search in common interconnection networks ⋮ Black Hole Search in Directed Graphs ⋮ An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem
This page was built for publication: The freeze-tag problem: How to wake up a swarm of robots