Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set $S$ of vertices (resp.\ edges) from a given graph $G$ such that the induced subgraph (resp.\ subgraph) $G \setminus S$ belongs to some class $\mathcal{H}$. We consider the case where graphs in $\mathcal{H}$ have treewidth bounded by $t$, and give a general framework to obtain approximation algorithms for both vertex and edge-deletion settings from approximation algorithms for certain natural graph partitioning problems called $k$-Subset Vertex Separator and $k$-Subset Edge Separator, respectively. For the vertex deletion setting, our framework combined with the current best result for $k$-Subset Vertex Separator, yields a significant improvement in the approximation ratios for basic problems such as $k$-Treewidth Vertex Deletion and Planar-$F$ Vertex Deletion. Our algorithms are simpler than previous works and give the first uniform approximation algorithms under the natural parameterization. For the edge deletion setting, we give improved approximation algorithms for $k$-Subset Edge Separator combining ideas from LP relaxations and important separators. We present their applications in bounded-degree graphs, and also give an APX-hardness result for the edge deletion problems.

[1]  Rajeev Motwani,et al.  Towards a syntactic characterization of PTAS , 1996, STOC '96.

[2]  Dániel Marx,et al.  Fixed-parameter tractability of multicut parameterized by the size of the cutset , 2010, STOC '11.

[3]  Peter Rossmanith,et al.  A Faster Parameterized Algorithm for Treedepth , 2014, ICALP.

[4]  Erik D. Demaine,et al.  The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..

[5]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[6]  Fedor V. Fomin,et al.  Bidimensionality and EPTAS , 2010, SODA '11.

[7]  Fedor V. Fomin,et al.  Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[8]  Dániel Marx,et al.  Parameterized graph separation problems , 2004, Theor. Comput. Sci..

[9]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Jianer Chen,et al.  An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem , 2007, WADS.

[11]  Pim van 't Hof,et al.  Parameterized complexity of vertex deletion into perfect graph classes , 2011, Theor. Comput. Sci..

[12]  Saket Saurabh,et al.  Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) , 2014, FSTTCS.

[13]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[14]  Robert Ganian,et al.  A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion , 2016, MFCS.

[15]  Ton Kloks,et al.  Better Algorithms for the Pathwidth and Treewidth of Graphs , 1991, ICALP.

[16]  Saket Saurabh,et al.  Uniform Kernelization Complexity of Hitting Forbidden Minors , 2015, ICALP.

[17]  Eun Jung Kim,et al.  Erdős-Pósa property of chordless cycles and its applications , 2018, SODA.

[18]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[19]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory, Ser. B.

[20]  Saket Saurabh,et al.  Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion , 2017, SODA.

[21]  Johan Håstad,et al.  On bounded occurrence constraint satisfaction , 2000, Inf. Process. Lett..

[22]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[23]  Pim van 't Hof,et al.  On the Computational Complexity of Vertex Integrity and Component Order Connectivity , 2014, Algorithmica.

[24]  Christophe Paul,et al.  Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions , 2012, ICALP.

[25]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[26]  Saket Saurabh,et al.  Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems , 2017, APPROX-RANDOM.

[27]  Vijay V. Vazirani,et al.  Finding k Cuts within Twice the Optimal , 1995, SIAM J. Comput..

[28]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[29]  Chandra Chekuri,et al.  Polynomial bounds for the grid-minor theorem , 2013, J. ACM.

[30]  Ken-ichi Kawarabayashi,et al.  Polylogarithmic Approximation for Minimum Planarization (Almost) , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[31]  Marcin Pilipczuk,et al.  Approximation and Kernelization for Chordal Vertex Deletion , 2016, SODA.

[32]  Michal Pilipczuk,et al.  Hardness of Approximation for H-free Edge Modification Problems , 2016, APPROX-RANDOM.

[33]  Jakub Gajarský,et al.  Kernelization Using Structural Parameters on Sparse Graph Classes , 2013, ESA.

[34]  Shimon Kogan,et al.  The Hardness of Approximating Hereditary Properties , 2005 .

[35]  Erik D. Demaine,et al.  Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.

[36]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[37]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[38]  Yixin Cao,et al.  Interval Deletion Is Fixed-Parameter Tractable , 2012, SODA.

[39]  James R. Lee,et al.  Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.

[40]  David P. Williamson,et al.  A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs , 1998, Oper. Res. Lett..

[41]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[42]  Euiwoong Lee,et al.  Partitioning a graph into small pieces with applications to path transversal , 2016, Mathematical Programming.

[43]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[44]  Mihalis Yannakakis,et al.  Multiway cuts in node weighted graphs , 2004, J. Algorithms.

[45]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[46]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory, Ser. B.

[47]  Dániel Marx,et al.  Parameterized vertex deletion problems for hereditary graph classes with a block property , 2016, WG.

[48]  Hans L. Bodlaender,et al.  Partition Into Triangles on Bounded Degree Graphs , 2012, Theory of Computing Systems.

[49]  Samuel Fiorini,et al.  Hitting Diamonds and Growing Cacti , 2010, IPCO.

[50]  Saket Saurabh,et al.  Tree Deletion Set Has a Polynomial Kernel but No OPTO(1) Approximation , 2013, SIAM J. Discret. Math..

[51]  Michal Pilipczuk,et al.  Linear kernels for edge deletion problems to immersion-closed graph classes , 2016, ICALP.

[52]  Prasad Raghavendra,et al.  Reductions between Expansion Problems , 2010, 2012 IEEE 27th Conference on Computational Complexity.

[53]  Roy Schwartz,et al.  Simplex Transformations and the Multiway Cut Problem , 2017, SODA.

[54]  Dan Geiger,et al.  Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem , 1996, Artif. Intell..

[55]  Venkatesan Guruswami,et al.  Inapproximability of H-Transversal/Packing , 2015, SIAM J. Discret. Math..

[56]  Michal Pilipczuk,et al.  An O(c^k n) 5-Approximation Algorithm for Treewidth , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[57]  Marcin Pilipczuk,et al.  A Fast Branching Algorithm for Cluster Vertex Deletion , 2014, CSR.

[58]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[59]  Pasin Manurangsi,et al.  An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut , 2017, IPCO.

[60]  Nikhil Bansal,et al.  LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs , 2017, SODA.