Search
Now showing items 1-1 of 1
A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems
(Massachusetts Institute of Technology, 2006)
In this thesis, we give a pseudo-polynomial time O(log² n)-approximation algorithm for a variant of the art gallery problem the point-guard problem. The point-guard problem involves finding the minimum number of points and ...