Hardness of Approximation for H -free Edge Modification Problems
From MaRDI portal
Publication:4973877
DOI10.1145/3196834zbMath1427.68105MaRDI QIDQ4973877
Marek Cygan, Michał Pilipczuk, Ivan A. Bliznets, Paweł Komosa
Publication date: 6 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3196834
hardness of approximation; fixed-parameter tractability; exponential time hypothesis; graph modification problems; \(H\)-free graphs
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
