Login / Signup
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms.
Ankush Acharyya
Vahideh Keikha
Diptapriyo Majumdar
Supantha Pandit
Published in:
Theor. Comput. Sci. (2024)
Keyphrases
</>
approximation algorithms
np hard
set cover
minimum cost
lower bound
constant factor
np hardness
primal dual
linear programming
worst case
np complete
markov chain
special case
approximation ratio
learning algorithm
randomized algorithms
approximation schemes
vertex cover