On subexponential and FPT-time inapproximability

DOI10.1007/s00453-014-9889-1zbMath1312.68232arXiv1211.6656MaRDI QIDQ2343081

Vangelis Th. Paschos, Édouard Bonnet, Bruno Escoffier, Eun Jung Kim

Publication date: 4 May 2015

Published in: Algorithmica, Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.6656

zbMATH Keywords

inapproximability; subexponential time; APETH; FPT-time

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms