Login / Signup
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems.
Akanksha Agrawal
Daniel Lokshtanov
Pranabendu Misra
Saket Saurabh
Meirav Zehavi
Published in:
CoRR (2017)
Keyphrases
</>
approximation algorithms
vertex cover
np hardness
special case
approximation schemes
np hard
randomized algorithms
network design problem
exact algorithms
optimization problems
learning algorithm
worst case
primal dual