How to guard a graph against tree movements

Fujito, T. and Sakamaki, T.

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.

Cite as: Fujito, T. and Sakamaki, T. (2012). How to guard a graph against tree movements. In Proc. Computing: The Australasian Theory Symposium (CATS 2012) Melbourne, Australia. CRPIT, 128. Mestre, J. Eds., ACS. 93-96

(from crpit.com) (local if available)