Cooperative mobile guards in grids (Q876501): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2006.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095509593 / rank | |||
Normal rank | |||
Revision as of 18:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cooperative mobile guards in grids |
scientific article |
Statements
Cooperative mobile guards in grids (English)
0 references
18 April 2007
0 references
Mobile guards in grids are studied here. Considering the classes of polygon-bounded grids, and simple grids [\textit{L. P. Gewali} and \textit{S. Ntafos}, Comput. Geom. 2, No. 6, 309--334 (1993; Zbl 0774.68058)], the authors propose a quadratic time algorithm for solving the problem of finding a minimum weakly cooperative guard set. This algorithm is based upon the property that horizontal and vertical grid segments may be covered independently, whereas the constructed guard set satisfies the condition of weak cooperation. Finally, complete rectangular grids with obstacles are investigated.
0 references
simple grids
0 references
cooperative guards
0 references
mobile guards
0 references
quadratic time algorithm
0 references
