TY - JOUR
T1 - A constant-factor approximation algorithm for optimal 1.5D terrain guarding
AU - Ben-Moshe, Boaz
AU - Katz, Matthew J.
AU - Mitchell, Joseph S.B.
PY - 2007
Y1 - 2007
N2 - We present the first constant-factor approximation algorithm for a nontrivial instance of the optimal guarding (coverage) problem in polygons. In particular, we give an O(1)-approximation algorithm for placing the fewest point guards on a 1.5D terrain, so that every point of the terrain is seen by at least one guard. While polylogarithmic-factor approximations follow from set cover results, our new results exploit the geometrie structure of terrains to obtain a substantially improved approximation algorithm.
AB - We present the first constant-factor approximation algorithm for a nontrivial instance of the optimal guarding (coverage) problem in polygons. In particular, we give an O(1)-approximation algorithm for placing the fewest point guards on a 1.5D terrain, so that every point of the terrain is seen by at least one guard. While polylogarithmic-factor approximations follow from set cover results, our new results exploit the geometrie structure of terrains to obtain a substantially improved approximation algorithm.
KW - Approximation algorithms
KW - Geometric optimization
KW - Guarding
UR - http://www.scopus.com/inward/record.url?scp=37849011990&partnerID=8YFLogxK
U2 - 10.1137/S0097539704446384
DO - 10.1137/S0097539704446384
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:37849011990
SN - 0097-5397
VL - 36
SP - 1631
EP - 1647
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 6
ER -