Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards.

Pritam Bhattacharya Subir Kumar Ghosh Sudebkumar Prasant Pal

Published in: CoRR (2017)

Keyphrases

approximation algorithms
undirected graph
constant factor
np hard
vertex cover
special case
worst case
minimum length
network design problem
facility location problem
set cover
approximation ratio
open shop
minimum cost
np hardness
minimum weight
randomized algorithms
partial order
learning algorithm