Approximation algorithms for art gallery problems in polygons.

Subir Kumar Ghosh

Published in: Discret. Appl. Math. (2010)

Keyphrases

approximation algorithms
vertex cover
randomized algorithms
np hard
special case
np hardness
optimization problems
approximation schemes
art gallery
network design problem
primal dual
approximation ratio
benchmark problems
minimum cost
partial order
distance function
evolutionary algorithm