A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
An Optimal Algorithm for Online Freeze-Tag
Fun with Algorithms
In the freeze-tag problem, one active robot must wake up many frozen robots. The robots are considered as points in a metric space, where active robots move at a constant rate and activate other robots by visiting them. In the (time-dependent) online variant of the problem, each frozen robot is not revealed until a specified time. Hammar, Nilsson, and Persson have shown that no online algorithm can achieve a competitive ratio better than 7/3 for online freeze-tag, and posed the question ofdoi:10.4230/lipics.fun.2021.8 dblp:conf/fun/BrunnerW21 fatcat:o5jdnxua5rdrpchvfs7hpipqwu