A constant-factor approximation algorithm for optimal terrain guarding

Boaz Ben-Moshe, Matthew Katz, Joseph S.B. Mitchell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

30 Scopus citations

Abstract

We present the first constant-factor approximation algorithm for a non-trivial 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 geometric structure of terrains to obtain a substantially improved approximation algorithm.

Original languageEnglish GB
Title of host publicationSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages515-524
Number of pages10
StatePublished - 1 Jul 2005
EventSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States
Duration: 23 Jan 200525 Jan 2005

Conference

ConferenceSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityVancouver, BC
Period23/01/0525/01/05

ASJC Scopus subject areas

  • Software
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'A constant-factor approximation algorithm for optimal terrain guarding'. Together they form a unique fingerprint.

Cite this