Hunting a rabbit: complexity, approximability and some characterizations

Walid Ben-Ameur, Harmender Gahlawat, Alessandro Maddaloni

In the Hunters and Rabbit game, $k$ hunters attempt to shoot an invisible rabbit on a given graph $G$. In each round, the hunters select $k$ vertices to shoot at, while the rabbit…