Approximation algorithms for guarding 1.5 dimensional terrains
The 1.5-dimensional terrain guarding problem gives an x-monotone chain (the terrain) and asks for the minimum set of vertices of the terrain (guards) such that every vertex of the terrain is seen by at least one guard. This terrain guarding problem is a restriction of the SET COVER problem, which...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/16609 |