Login / Signup

Two NP-Hard Art-Gallery Problems for Ortho-Polygons.

Dietmar SchuchardtHans-Dietrich Hecker
Published in: Math. Log. Q. (1995)
Keyphrases
  • np hard
  • np complete
  • decision problems
  • computational complexity
  • scheduling problem
  • linear programming
  • multi objective
  • orders of magnitude
  • benchmark problems
  • art gallery