Login / Signup
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size.
Bart M. P. Jansen
Jari J. H. de Kroon
Michal Wlodarczyk
Published in:
CoRR (2023)
Keyphrases
</>
closed form
space complexity
upper approximation
approximation methods
discrete random variables
search space
approximation algorithms
approximation schemes
upper bound
bounded treewidth
search algorithm
multi objective
linear approximation