Approximation algorithms for the freeze tag problem inside polygons
نویسندگان
1 Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
2 Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
3 Computer Engineering Department, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran
doi
10.22108/toc.2025.143753.2229چکیده
The freeze tag problem (FTP) aims to awaken a swarm of robots with one or more initially awake robots as soon as possible. Each awake robot must touch a sleeping robot to wake it up. Once a robot is awakened, it can assist in awakening other sleeping robots. We study this problem inside a polygonal domain and present approximation algorithms for it.
