An Efficient Algorithm for Mobile Guarded Guards in Simple Grids

DOI10.1007/11751540_16zbMATH Open1162.68755OpenAlexW1826240976MaRDI QIDQ5505331FDOQ5505331

Authors: Adrian Kosowski, Michal Malafiejski, Paweł Żyliński 

Publication date: 27 January 2009

Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11751540_16

Recommendations

• Cooperative mobile guards in grids
• Guarding in a simple polygon
• Mobile versus point guards
• Fault Tolerant Guarding of Grids
• THE TWO GUARDS PROBLEM

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (4)

• A (7/2)-approximation algorithm for guarding orthogonal art galleries with sliding cameras
• Cooperative mobile guards in grids
• An efficient algorithm for the three-guard problem
• Fault Tolerant Guarding of Grids

This page was built for publication: An Efficient Algorithm for Mobile Guarded Guards in Simple Grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505331)