Add to ORKGWe show a constant factor approximation algorithm for interior guarding of monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon. If the size of the smallest interior guard cover is \OPT\ for a rectilinear polygon, our algorithm produces a guard set of size~$O(\OPT^2)$
The art gallery problem enquires about the least number of guards that are sufficient to ensure that...
AbstractIn this paper, we present approximation algorithms for minimum vertex and edge guard problem...
We describe a polynomial time O(k log log OPTk(P))-approximation algorithm for the k-guarding proble...
We show a constant factor approximation algorithm for interior guarding ofmonotone polygons. Using t...
Abstract We present the first constant-factor approximation algorithm for a non-trivial instance of ...
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum numbe...
We exhibit two linear time approximation algorithms for guarding rectilinear staircase polygons both...
AbstractA Tk-guard G in a rectilinear polygon P is a tree of diameter k completely contained in P. T...
The 1.5-dimensional terrain guarding problem gives an x-monotone chain (the terrain) and asks for t...
AbstractWe prove that guarding the vertices of a rectilinear polygon P, whether by guards lying at v...
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection w...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
The art gallery problem enquires about the least number of guards that are sufficient to ensure that...
AbstractIn this paper, we present approximation algorithms for minimum vertex and edge guard problem...
We describe a polynomial time O(k log log OPTk(P))-approximation algorithm for the k-guarding proble...
We show a constant factor approximation algorithm for interior guarding ofmonotone polygons. Using t...
Abstract We present the first constant-factor approximation algorithm for a non-trivial instance of ...
Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum numbe...
We exhibit two linear time approximation algorithms for guarding rectilinear staircase polygons both...
AbstractA Tk-guard G in a rectilinear polygon P is a tree of diameter k completely contained in P. T...
The 1.5-dimensional terrain guarding problem gives an x-monotone chain (the terrain) and asks for t...
AbstractWe prove that guarding the vertices of a rectilinear polygon P, whether by guards lying at v...
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection w...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We give an $O(\sqrt{\log n})$ factor approximation algorithm for covering a rectilinear polygon with...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
We consider the problem of covering arbitrary polygons with rectangles. The rectangles must lie enti...
The art gallery problem enquires about the least number of guards that are sufficient to ensure that...
AbstractIn this paper, we present approximation algorithms for minimum vertex and edge guard problem...
We describe a polynomial time O(k log log OPTk(P))-approximation algorithm for the k-guarding proble...