Ivan Bliznets
Abstract
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of view of parameterized complexity and kernelization. In particular, it was shown that the problems do not admit polynomial kernels (under plausible complexity assumptions) for almost all graphs H, with several important exceptions occurring when the class of H-free graphs exhibits some structural properties.
In this work, we complement the parameterized study of edge modification problems to H-free graphs by considering their approximability. We prove that whenever H is 3-connected and has at least two nonedges, then both H-free Edge Deletion and H-free Edge Completion are very hard to approximate: they do not admit poly(OPT)-approximation in polynomial time, unless P=NP, or even in time subexponential in OPT, unless the exponential time hypothesis fails. The assumption of the existence of two nonedges appears to be important: we show that whenever H is a complete graph without one edge, then H-free Edge Deletion is tightly connected to the Min Horn Deletion problem, whose approximability is still open. Finally, in an attempt to extend our hardness results beyond 3-connected graphs, we consider the cases of H being a path or a cycle, and we achieve an almost complete dichotomy there.
- N. R. Aravind, R. B. Sandeep, and N. Sivadasan. 2017. Dichotomy results on the hardness of H-free edge modification problems. SIAM Journal on Discrete Mathematics 31, 1, 542--561.Google Scholar
Cross Ref
- Ivan Bliznets, Marek Cygan, Paweł Komosa, Lukáš Mach, and Michał Pilipczuk. 2016. Lower bounds for the parameterized complexity of minimum fill-in and other completion problems. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’16). 1132--1151. Google ScholarDigital Library
- Leizhen Cai. 1996. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58, 4, 171--176. Google ScholarDigital Library
- Leizhen Cai and Yufei Cai. 2015. Incompressibility of H-free edge modification problems. Algorithmica 71, 3, 731--757. Google ScholarDigital Library
- Yufei Cai. 2012. Polynomial Kernelisation of H-free edge Modification Problems. Master’s Thesis. Chinese University of Hong Kong.Google Scholar
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Erik Jan van Leeuwen, and Marcin Wrochna. 2017. Polynomial kernelization for removing induced claws and diamonds. Theory of Computing Systems 60, 4, 615--636. Google ScholarDigital Library
- Pål Grønås Drange, Fedor V. Fomin, Michał Pilipczuk, and Yngve Villanger. 2015. Exploring the subexponential complexity of completion problems. ACM Transactions on Computation Theory 7, 4, 14:1--14:38. Google ScholarDigital Library
- Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchý. 2016. Tree deletion set has a polynomial kernel but no OPTO(1) approximation. SIAM Journal on Discrete Mathematics 30, 3, 1371--1384.Google ScholarCross Ref
- Sylvain Guillemot, Frédéric Havet, Christophe Paul, and Anthony Perez. 2013. On the (non-)existence of polynomial kernels for Pell-free edge modification problems. Algorithmica 65, 4, 900--926. Google ScholarDigital Library
- Russell Impagliazzo and Ramamohan Paturi. 2001. On the complexity of k-SAT. Journal of Computer and System Sciences 62, 2, 367--375. Google ScholarDigital Library
- Haim Kaplan, Ron Shamir, and Robert Endre Tarjan. 1999. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal on Computing 28, 5, 1906--1922. Google ScholarDigital Library
- Sanjeev Khanna, Madhu Sudan, Luca Trevisan, and David P. Williamson. 2001. The approximability of constraint satisfaction problems. SIAM Journal on Computing 30, 6, 1863--1920. Google ScholarDigital Library
- Stefan Kratsch and Magnus Wahlström. 2013. Two edge modification problems without polynomial kernels. Discrete Optimization 10, 3, 193--199.Google ScholarCross Ref
- Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2011. Lower bounds based on the exponential time hypothesis. Bulletin of the EATCS 105, 41--72.Google Scholar
- Assaf Natanzon. 1999. Complexity and Approximation of Some Graph Modification Problems. Master’s Thesis. Department of Computer Science, Tel Aviv University.Google Scholar
- R. B. Sandeep and N. Sivadasan. 2015. Parameterized lower bound and improved kernel for diamond-free edge deletion. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Vol. 43. Schloss Dagstuhl—Leibniz-Zentrum für Informatik, 365--376.Google Scholar
Index Terms
- Hardness of Approximation for H-free Edge Modification Problems
Recommendations
Incompressibility of H-free edge modification problems: Towards a dichotomy
AbstractGiven a graph G and an integer k, the H -free Edge Editing problem is to find whether there exist at most k pairs of vertices in G such that changing the adjacency of the pairs in G results in a graph without any induced ...
Hardness of edge-modification problems
For a graph property P consider the following computational problem. Given an input graph G, what is the minimum number of edge modifications (additions and/or deletions) that one has to apply to G in order to turn it into a graph that satisfies P? ...
On Switching to H-Free Graphs
In this article, we study the problem of deciding if, for a fixed graph H, a given graph is switching equivalent to an H-free graph. Polynomial-time algorithms are known for H having at most three vertices or isomorphic to P4. We show that for H ...
Comments