From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

DOI10.1137/18M1166869zbMath1452.68083WikidataQ115525600 ScholiaQ115525600MaRDI QIDQ5115701

Luca Trevisan, Marek Cygan, Guy Kortsarz, Danupon Nanongkai, Bundit Laekhanukit, Parinya Chalermsook, Pasin Manurangsi

Publication date: 18 August 2020

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

clique; dominating set; hardness of approximation; parameterized complexity; subexponential-time algorithms; fine-grained complexity

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

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

68Q27: Parameterized complexity, tractability and kernelization