Guarding Strategic Points of a Gallery
Mohammad Hosseinzadeh Moghaddam, Alireza Bagheri, Ali Safari Mamaghani, Saeid Taghavi Afshord · 2009
Many problems have posed in the art gallery theorem. Most of them are NP-hard. In this paper, we pose the new problem of guarding strategic points of a gallery. Given a polygon P with n vertices and m strategic points which are in that polygon, determine minimum number of guards for guarding the strategic points. In this paper, we present approximation algorithms for point, vertex and edge guard versions of this new problem.