Efficient parallel implementations of approximation algorithms for guarding 1.5D terrains
In the 1.5D terrain guarding problem, an x-monotone polygonal line is dened by k vertices and a G set of terrain points, i.e. guards, and a N set of terrain points which guards are to observe (guard). This involves a weighted version of the guarding problem where guards G have weights. The goal is t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Croatian Operational Research Society
2015-03-01
|
| Series: | Croatian Operational Research Review |
| Subjects: | |
| Online Access: | http://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=204289 |