How to guard a graph against tree movements

  • Authors:

  • Toshihiro Fujito;Takayoshi Sakamaki

  • Affiliations:

  • Toyohashi University of Technology, Toyohashi, Japan;Toyohashi University of Technology, Toyohashi, Japan

  • Venue:
  • CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.