Skip to main content
Springer Nature Link
Log in

Weakly Cooperative Guards in Grids

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3480))

Included in the following conference series:

  • 1014 Accesses

Abstract

We show that a minimum coverage of a grid of n segments has n–p 3 weakly cooperative guards, where p 3 is the size of the maximum P 3-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 P 3-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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Berman, F., Johnson, D., Leighton, T., Shor, P.W., Snyder, L.: Generalized planar matching. J. Algorithms 11, 153–184 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Czyżowicz, J., Kranakis, E., Urrutia, J.: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Info. Proc. Lett. 66, 125–126 (1998)

    Google Scholar 

  3. De Bontridder, K.M.J., Haldórsson, B.V., Haldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Mathematical Programming 98, 477–491 (2003)

    Google Scholar 

  4. Deogun, J.S., Sarasamma, S.T.: On the minimum cooperative guards problem. J. Combin. Math. Combin. Comput. 22, 161–182 (1996)

    MATH  MathSciNet  Google Scholar 

  5. Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J. Algorithms 7, 174–184 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Finke, U., Hinchirs, K.: Overlaying simply connected planar subdivisions in linear time. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 119–126 (1995)

    Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theorey of NP-completeness. Freeman, New York (1979)

    Google Scholar 

  8. Hell, P., Kirkpatrick, D.G.: On the complexity of general graph factor problems. SIAM Journal of Comput. 12, 601–609 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hernández-Peñalver, G.: Controlling guards. In: Proc. of Sixth Canadian Conference on Computational Geometry, pp. 387–392 (1994)

    Google Scholar 

  10. Liaw, B.C., Lee, R.C.T.: An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons. Info. Proc. Lett. 57, 69–75 (1994)

    Article  MathSciNet  Google Scholar 

  11. Liaw, B.C., Huang, N.F., Lee, R.C.T.: The minimum cooperative guards problem on k-spiral polygons. In: Proc. of Fifth Canadian Conference on Computational Geometry, pp. 97–101 (1993)

    Google Scholar 

  12. Masuyama, S., Ibaraki, T.: Chain packing in graphs. Algorithmica 6, 826–839 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  13. Nierhoff, T., Żyliński, P.: Cooperative guards in grids. In: Third Annual CGC Workshop (2003)

    Google Scholar 

  14. Ntafos, S.: On gallery watchman in grids. Info. Proc. Lett. 23, 99–102 (1986)

    Article  MATH  Google Scholar 

  15. O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)

    MATH  Google Scholar 

  16. Urrutia, J.: Art Gallery and Illumination Problems, Handbook on Computational Geometry. Elsevier Science, Amsterdam (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland

    Michał Małafiejski

  2. Institute of Mathematics, Gdańsk University, Poland

    Paweł Żyliński

Authors
  1. Michał Małafiejski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Żyliński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W, T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, P.O. Box, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, P.O. Box, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Małafiejski, M., Żyliński, P. (2005). Weakly Cooperative Guards in Grids. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424758_68

Download citation

  • DOI: https://doi.org/10.1007/11424758_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25860-5

  • Online ISBN: 978-3-540-32043-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics