Skip to main content
SpringerLink
Log in

Cops and Robber Game without Recharging

  • Conference paper
Algorithm Theory - SWAT 2010 (SWAT 2010)

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

Included in the following conference series:

Abstract

Cops & Robber is a classical pursuit-evasion game on undirected graphs, where the task is to identify the minimum number of cops sufficient to catch the robber. In this work, we consider a natural variant of this game, where every cop can make at most f steps, and prove that for each f ≄ 2, it is PSPACE-complete to decide whether k cops can capture the robber.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8, 1–11 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alspach, B.: Searching and sweeping graphs: a brief survey. Matematiche (Catania) 59, 5–37 (2006)

    MathSciNet  Google Scholar 

  3. Dumitrescu, A., Suzuki, I., Zylinski, P.: Offline variants of the ”lion and man” problem. In: Proceedings of the 23d annual symposium on Computational Geometry (SCG 07), pp. 102–111. ACM, New York (2007)

    Chapter  Google Scholar 

  4. Fomin, F.V., Golovach, P.A., KratochvĂ­l, J.: On tractability of cops and robbers game. In: Ausiello, G., KarhumĂ€ki, J., Mauri, G., Ong, C.-H.L. (eds.) IFIP TCS. IFIP, vol. 273, pp. 171–185. Springer, Heidelberg (2008)

    Google Scholar 

  5. Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399, 236–245 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co, San Francisco (1979); A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences

    MATH  Google Scholar 

  7. Goldenberg, M., Kovarsky, A., Wu, X., Schaeffer, J.: Multiple agents moving target search. In: Proceedings of the 18th international joint conference on Artificial Intelligence (IJCAI ’03), pp. 1536–1538. Morgan Kaufmann Publishers Inc., San Francisco (2003)

    Google Scholar 

  8. Goldstein, A.S., Reingold, E.M.: The complexity of pursuit on a graph. Theoret. Comput. Sci. 143, 93–112 (1995)

    MATH  MathSciNet  Google Scholar 

  9. Guibas, L.J., Claude Latombe, J., Lavalle, S.M., Lin, D., Motwani, R.: A visibility-based pursuit-evasion problem. International Journal of Computational Geometry and Applications 9, 471–494 (1996)

    Google Scholar 

  10. Isaacs, R.: Differential games. A mathematical theory with applications to warfare and pursuit, control and optimization. John Wiley & Sons Inc., New York (1965)

    MATH  Google Scholar 

  11. Ishida, T., Korf, R.E.: Moving target search. In: Proceedings of the International joint conference on Artificial Intelligence (IJCAI’91), pp. 204–211 (1991)

    Google Scholar 

  12. Ishida, T., Korf, R.E.: Moving-target search: A real-time search for changing goals. IEEE Trans. Pattern Anal. Mach. Intell. 17, 609–619 (1995)

    Article  Google Scholar 

  13. Littlewood, J.E.: Littlewood’s miscellany. Cambridge University Press, Cambridge (1986); Edited and with a foreword by BĂ©la BollobĂĄs

    Google Scholar 

  14. Loh, P.K.K., Prakash, E.C.: Novel moving target search algorithms for computer gaming. Comput. Entertain. 7, 1–16 (2009)

    Article  Google Scholar 

  15. Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. Assoc. Comput. Mach. 35, 18–44 (1988)

    MATH  MathSciNet  Google Scholar 

  16. Moldenhauer, C., Sturtevant, N.R.: Evaluating strategies for running from the cops. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 584–589 (2009)

    Google Scholar 

  17. Moldenhauer, C., Sturtevant, N.R.: Optimal solutions for moving target search. In: Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), IFAAMAS, pp. 1249–1250 (2009)

    Google Scholar 

  18. Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43, 235–239 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  19. Quilliot, A.: Some results about pursuit games on metric spaces obtained through graph theory techniques. European J. Combin. 7, 55–66 (1986)

    MATH  MathSciNet  Google Scholar 

  20. Sgall, J.: Solution of David Gale’s lion and man problem. Theor. Comput. Sci. 259, 663–670 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  21. Sugihara, K., Suzuki, I., Yamashita, M.: The searchlight scheduling problem. SIAM J. Comput. 19, 1024–1040 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Fedor V. Fomin & Daniel Lokshtanov

  2. School of Engineering and Computing Sciences, Durham University, South Road, DH1 3LE, Durham, UK

    Petr A. Golovach

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Petr A. Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Lokshtanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Haim Kaplan

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fomin, F.V., Golovach, P.A., Lokshtanov, D. (2010). Cops and Robber Game without Recharging. In: Kaplan, H. (eds) Algorithm Theory - SWAT 2010. SWAT 2010. Lecture Notes in Computer Science, vol 6139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13731-0_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13730-3

  • Online ISBN: 978-3-642-13731-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation