Login / Signup
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size.
Bart M. P. Jansen
Jari J. H. de Kroon
Michal Wlodarczyk
Published in:
ESA (2023)
Keyphrases
</>
closed form
space complexity
approximation methods
discrete random variables
upper bound
linear approximation
neural network
integer programming
exact solution
data sets
knowledge base
case study
objective function
search space
bounded treewidth
approximation schemes