eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-12-14
24:1
24:15
10.4230/LIPIcs.ISAAC.2022.24
article
Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy
Belova, Tatiana
1
Bliznets, Ivan
1
St. Petersburg Department of Steklov Mathematical Institute of the RAS, Russia
For a fixed graph H, the H-free Edge Deletion/Completion/Editing problem asks to delete/add/edit the minimum possible number of edges in G to get a graph that does not contain an induced subgraph isomorphic to the graph H. In this work, we investigate H-free Edge Deletion/Completion/Editing problems in terms of the hardness of their approximation. We formulate a conjecture according to which all the graphs with at least five vertices can be classified into several groups of graphs with specific structural properties depending on the hardness of approximation for the corresponding H-free Edge Deletion/Completion/Editing problems. Also, we make significant progress in proving that conjecture by showing that it is sufficient to resolve it only for a finite set of graphs.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol248-isaac2022/LIPIcs.ISAAC.2022.24/LIPIcs.ISAAC.2022.24.pdf
Parameterized complexity
Hardness of approximation
Edge modification problems