OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
From MaRDI portal
Publication:5289296
DOI10.1142/S0218195993000063zbMath0784.90098MaRDI QIDQ5289296
Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
Publication date: 22 August 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
polygonNP-hardart gallery problem\(m\)-watchman routes problemoptimum guard coverswatchmen route problem
Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Related Items (4)
\(k\)-Transmitter watchman routes ⋮ Multiagent visual area coverage using a new genetic algorithm selection scheme ⋮ Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem ⋮ Approximability of guarding weak visibility polygons
This page was built for publication: OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
