Approximating Partially Bounded Degree Deletion on Directed Graphs

The Bounded Degree Deletion problem (BDD) is that of computing a minimum vertex set in a graph \(G=(V, E)\) with degree bound \(b: V\rightarrow \mathbb {Z}_+\), such that, when it is removed from G, the degree of any remaining vertex v is no larger than b(v). It is a classic problem in graph theory and various results have been obtained including an approximation ratio of \(2+\ln b_{\max }\) [30], where \(b_{\max }\) is the maximum degree bound.

[1]  Rolf Niedermeier,et al.  On Bounded-Degree Vertex Deletion parameterized by treewidth , 2012, Discret. Appl. Math..

[2]  Venkatesan Guruswami,et al.  A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover , 2005, SIAM J. Comput..

[3]  George Karakostas,et al.  A better approximation ratio for the vertex cover problem , 2005, TALG.

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

[5]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

[6]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[7]  Rolf Niedermeier,et al.  A Generalization of Nemhauser and Trotter's Local Optimization Theorem , 2009, STACS.

[8]  Ingo Schiermeyer,et al.  On computing the minimum 3-path vertex cover and dissociation number of graphs , 2011, Theor. Comput. Sci..

[9]  Rastislav Krivos-Bellus,et al.  On the weighted k-path vertex cover problem , 2014, Discret. Appl. Math..

[10]  Aravind Srinivasan,et al.  Improved Approximation Algorithms for the Partial Vertex Cover Problem , 2002, APPROX.

[11]  Tapio Elomaa,et al.  Covering Analysis of the Greedy Algorithm for Partial Cover , 2010, Algorithms and Applications.

[12]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[13]  Jean Cardinal,et al.  A Primal-Dual 3-Approximation Algorithm for Hitting 4-Vertex Paths , 2014 .

[14]  Marko Jakovac,et al.  On the k-path vertex cover of some graph products , 2013, Discret. Math..

[15]  Jianer Chen,et al.  Randomized parameterized algorithms for $$P_2$$P2-Packing and Co-Path Packing problems , 2015, J. Comb. Optim..

[16]  Toshihiro Fujito.  On approximation of the submodular set cover problem , 1999, Oper. Res. Lett..

[17]  Zhi-Zhong Chen,et al.  A Linear Kernel for Co-Path/Cycle Packing , 2010, AAIM.

[18]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[19]  Angsuman Das.  Partial Domination in Graphs , 2017, Iranian Journal of Science and Technology, Transactions A: Science.

[20]  Cédric Chauve,et al.  A Methodological Framework for the Reconstruction of Contiguous Regions of Ancestral Genomes and Its Application to Mammalian Genomes , 2008, PLoS Comput. Biol..

[21]  Jianhua Tu,et al.  A fixed-parameter algorithm for the vertex cover P3 problem , 2015, Inf. Process. Lett..

[22]  Bostjan Bresar,et al.  Minimum k-path vertex cover , 2010, Discret. Appl. Math..

[23]  Petr Slavík.  Improved Performance of the Greedy Algorithm for Partial Cover , 1997, Inf. Process. Lett..

[24]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[25]  Mihalis Yannakakis,et al.  Node-Deletion Problems on Bipartite Graphs , 1981, SIAM J. Comput..

[26]  Joachim Kneis,et al.  Partial vs. Complete Domination: t-Dominating Set , 2007, SOFSEM.

[27]  Toshihiro Fujito,et al.  A unified approximation algorithm problems ” , 1998 .

[28]  Wenli Zhou,et al.  A primal-dual approximation algorithm for the vertex cover P3 problem , 2011, Theor. Comput. Sci..

[29]  Toshihiro Fujito,et al.  Approximating Partially Bounded Degree Deletion on Directed Graphs , 2019, J. Graph Algorithms Appl..

[30]  Amnon Barak,et al.  A new approach for approximating node deletion problems , 2003, Inf. Process. Lett..

[31]  Bostjan Bresar,et al.  On the vertex kk-path cover , 2013, Discret. Appl. Math..

[32]  Rajiv Gandhi,et al.  Approximation algorithms for partial covering problems , 2004, J. Algorithms.

[33]  Christian Sohler,et al.  Every property of hyperfinite graphs is testable , 2011, STOC '11.

[34]  Toshihiro Fujito,et al.  Approximating Bounded Degree Deletion via Matroid Matching , 2017, CIAC.

[35]  Wenli Zhou,et al.  A factor 2 approximation algorithm for the vertex cover P3 problem , 2011, Inf. Process. Lett..

[36]  Reuven Bar-Yehuda,et al.  Using homogenous weights for approximating the partial cover problem , 2001, SODA '99.

[37]  Jianhua Tu,et al.  The vertex cover P3P3 problem in cubic graphs , 2013, Inf. Process. Lett..

[38]  Gerd Finke,et al.  The complexity of dissociation set problems in graphs , 2011, Discret. Appl. Math..

[39]  Rolf Niedermeier,et al.  Exact combinatorial algorithms and experiments for finding maximum k-plexes , 2012, J. Comb. Optim..

[40]  Benjamin M. Case,et al.  Partial Domination in Graphs , 2017, 1705.03096.