Fault tolerant guarding of grids

Authors:
Adrian Kosowski;Michał Małafiejski;Paweł Żyliński
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology;Department of Algorithms and System Modeling, Gdańsk University of Technology;Institute of Mathematics, University of Gdańsk
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 14
Cited 0

Planar 3DM is NP-complete

Journal of Algorithms
On gallery watchmen in grids

Information Processing Letters
Art gallery theorems and algorithms

Art gallery theorems and algorithms
On grid intersection graphs

Discrete Mathematics
An optimal algorithm for intersecting line segments in the plane

Journal of the ACM (JACM)
An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons

Information Processing Letters
Overlaying simply connected planar subdivisions in linear time

Proceedings of the eleventh annual symposium on Computational geometry
Handbook of combinatorics (vol. 1)

Handbook of combinatorics (vol. 1)
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments

Information Processing Letters
Complexity of recognizing equal unions in families of sets

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating Maximum Edge Coloring in Multigraphs

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Path factors in cubic graphs

Journal of Graph Theory
Weakly cooperative guards in grids

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we deal with one of the art gallery problems, namely the problem of fault tolerant guarding of grids, which is defined as the problem of finding two disjoint guard sets in a grid. Although determining the existence of such a structure is easy in general grids, the task of minimising the number of guards taken over both teams is shown to be NP-hard even for subcubic grids. Moreover, we propose a 6/5-approximation algorithm for solving the fault tolerant guard problem in grids.