Login / Signup
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover.
Florent Foucaud
Esther Galby
Liana Khazaliya
Shaohua Li
Fionn Mc Inerney
Roohani Sharma
Prafullkumar Tale
Published in:
ICALP (2024)
Keyphrases
</>
vertex cover
lower bound
double exponential
upper bound
approximation algorithms
np complete
np hard
partial order
objective function
computational complexity
optimization problems
decision problems
branch and bound algorithm
partially ordered