Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains

  • Stephan Eidenbenz
Conference paper

DOI: 10.1007/3-540-45471-3_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2368)
Cite this paper as:
Eidenbenz S. (2002) Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. In: Penttonen M., Schmidt E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg

Abstract

We study the problem Minimum Hidden Guard Set, which consists of positioning a minimum number of guards in a given polygon or terrain such that no two guards see each other and such that every point in the polygon or on the terrain is visible from at least one guard. By constructing a gap-preserving reduction from Maximum 5-Ocurrence-3-Satisfiability, we show that this problem cannot be approximated by a polynomial-time algorithm with an approximation ratio of n1−ε for any ε > 0, unless NP = P, where n is the number of polygon or terrain vertices. The result even holds for input polygons without holes. This separates the problem from other visibility problems such as guarding and hiding, where strong inapproximability results only hold for polygons with holes. Furthermore, we show that an approximation algorithm achieves a matching approximation ratio of n.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Stephan Eidenbenz
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZürichSwitzerland

Personalised recommendations