Improved bounds for cops-and-robber pursuit

DOI10.1016/j.comgeo.2011.03.001zbMath1227.91007OpenAlexW2026542402MaRDI QIDQ634246

Laurent Alonso, Edward M. Reingold

Publication date: 2 August 2011

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.03.001

zbMATH Keywords

cops and robberpursuitevasionlion and manrabbit and robot

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
• Escaping offline searchers and isoperimetric theorems
• Bounds for cops and robber pursuit
• How many lions are needed to clear a grid?
• On the Least Number of Unit Circles Which Can Cover a Square

This page was built for publication: Improved bounds for cops-and-robber pursuit