Approximation algorithms for geometric conflict free covering problems.

Aritra Banik Vibha Sahlot Saket Saurabh

Published in: Comput. Geom. (2020)

Keyphrases

approximation algorithms
vertex cover
conflict free
np hardness
np hard
randomized algorithms
approximation schemes
special case
worst case
optimization problems
network design problem
practical problems
constant factor
minimum cost
set cover
database
reinforcement learning