Weakly Cooperative Guards in Grids

  • Michał Małafiejski
  • Paweł Żyliński
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3480)

Abstract

We show that a minimum coverage of a grid of n segments has np3 weakly cooperative guards, where p3 is the size of the maximum P3-matching in the intersection graph of the grid. This makes the minimum weakly cooperative guards problem in grids NP-hard, as we prove that the maximum P3-matching problem in subcubic bipartite planar graphs is NP-hard. At last, we propose a 7/6-approximation algorithm for the minimum weakly cooperative guards problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Michał Małafiejski
    • 1
  • Paweł Żyliński
    • 2
  1. 1.Department of Algorithms and System ModelingGdańsk University of TechnologyPoland
  2. 2.Institute of MathematicsGdańsk UniversityPoland

Personalised recommendations