Improved approximation algorithms for minimum power covering problems.

Gruia Calinescu Guy Kortsarz Zeev Nutov

Published in: Theor. Comput. Sci. (2019)

Keyphrases

approximation algorithms
vertex cover
minimum cost
constant factor
randomized algorithms
approximation schemes
exact algorithms
optimization problems
np hard
special case
approximation ratio
worst case
np hardness
quadratic program
disjoint paths
np complete
simulated annealing
lower bound