Showing cs.CGShow all
2 papers · 1 filter
cs.CG2025
Freeze-Tag is Strongly NP-hard in 2D with Distances
Lucas de Oliveira Silva, Lehilton Lelis Chaves Pedrosa
The Freeze-Tag Problem (FTP) asks for the minimum time needed to activate a swarm of robots, starting from a single active robot. When an active robot reaches a frozen robot, the l…
cs.CG2023
Freeze-Tag is NP-Hard in 3D with distance
Lucas de Oliveira Silva
Arkin et al. in 2002 introduced a scheduling-like problem called Freeze-Tag Problem (FTP) motivated by robot swarm activation. The input consists of the locations of n mobile punct…