How to guard a graph against tree movements
Toshihiro Fujito, Takayoshi Sakamaki · Computing: The Australasian Theory Symposium · 2012
This paper shows that the optimization problem arising from the guarding game played between the cop and robber players on an undirected graph can be approximated within a factor of Θ(log n) when the robber region is a tree.