Freeze-Tag in $L_1$ has Wake-up Time Five
Freeze-Tag in $L_1$ has Wake-up Time Five
The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of $n$ robots, starting from a single active robot. In the basic geometric version, every robot is given coordinates in the plane. As soon as a robot is awakened, it can move towards inactive robots …