How to guard a graph against tree moves

Authors:
Toshihiro Fujito;Takayoshi Sakamaki
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
2013

Citing 5
Cited 0

On the hardness of approximating minimization problems

Journal of the ACM (JACM)
The Guarding Problem --- Complexity and Approximation

Combinatorial Algorithms
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Cop-robber guarding game with cycle robber-region

Theoretical Computer Science
How to Guard a Graph?

Algorithmica

Quantified Score

Hi-index	0.89

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 in polynomial time within a factor of @Q(logn) when the robber moves along a tree.