Publication:4636433

DOI10.4230/LIPIcs.APPROX-RANDOM.2016.3zbMath1398.68188arXiv1606.02688MaRDI QIDQ4636433

Marek Cygan, Michał Pilipczuk, Ivan A. Bliznets, Paweł Komosa

Publication date: 19 April 2018

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

zbMATH Keywords

hardness of approximation; parameterized complexity; kernelization; edge modification problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

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