Login / Signup
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems.
Akanksha Agrawal
Daniel Lokshtanov
Pranabendu Misra
Saket Saurabh
Meirav Zehavi
Published in:
ACM Trans. Algorithms (2020)
Keyphrases
</>
approximation algorithms
vertex cover
randomized algorithms
np hard
approximation schemes
worst case
np hardness
exact algorithms
primal dual
np complete
special case
network design problem
set cover
facility location problem
genetic algorithm
minimum cost
approximation ratio
search algorithm
optimal solution