Login / Signup

Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard.

Chuzo Iwamoto
Published in: IEICE Trans. Inf. Syst. (2017)
Keyphrases
  • np hard
  • computational complexity
  • optimal solution
  • lower bound
  • minimum cost
  • knowledge base
  • linear programming
  • fixed number