Slightly Superexponential Parameterized Problems
From MaRDI portal
Publication:5745079
DOI10.1137/16M1104834zbMath1393.68077arXiv1902.08723MaRDI QIDQ5745079
Saket Saurabh, Daniel Lokshtanov, Dániel Marx
Publication date: 5 June 2018
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.08723
treewidth; distortion; lower bound; parameterized complexity; exponential time hypothesis; closest string
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W32: Algorithms on strings
