On the Complexity of the Upper r-Tolerant Edge Cover Problem

[1]  Frank Harary,et al.  Double Domination in Graphs , 2000, Ars Comb..

[2]  Chung-Shou Liao,et al.  K-tuple Domination in Graphs , 2003, Inf. Process. Lett..

[3]  David Manlove,et al.  On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs , 1999, Discret. Appl. Math..

[4]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[5]  Joseph Douglas Horton,et al.  Minimum Edge Dominating Sets , 1993, SIAM J. Discret. Math..

[6]  Jérôme Monnot,et al.  Weighted Upper Edge Cover: Complexity and Approximability , 2020, J. Graph Algorithms Appl..

[7]  Kellogg S. Booth,et al.  Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[8]  D. Corneil,et al.  A dynamic programming approach to the dominating set problem on k trees , 1987 .

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

[10]  Jian Shen,et al.  Approximating the spanning star forest problem and its applications to genomic sequence alignment , 2007, SODA '07.

[11]  Ioannis Caragiannis,et al.  An Improved Approximation Bound for Spanning Star Forest and Color Saving , 2009, MFCS.

[12]  Sandip Banerjee,et al.  Algorithm and Hardness Results on Liar's Dominating Set and \varveck -tuple Dominating Set , 2019, IWOCA.

[13]  Martin Farber,et al.  Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[14]  André Raspaud,et al.  Upper k-tuple domination in graphs , 2012, Discret. Math. Theor. Comput. Sci..

[15]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[16]  Peter Damaschke,et al.  Domination in Convex and Chordal Bipartite Graphs , 1990, Inf. Process. Lett..

[17]  Christian Laforest,et al.  Hardness results and approximation algorithms of k-tuple domination in graphs , 2004, Inf. Process. Lett..

[18]  Odile Favaron,et al.  k-Domination and k-Independence in Graphs: A Survey , 2012, Graphs Comb..

[19]  Marc Demange,et al.  Hardness and approximation of minimum maximal matchings† , 2014, Int. J. Comput. Math..

[20]  Miroslav Chlebík,et al.  Complexity of approximating bounded variants of optimization problems , 2006, Theor. Comput. Sci..

[21]  Vangelis Th. Paschos,et al.  The many facets of upper domination , 2017, Theor. Comput. Sci..

[22]  Alan A. Bertossi,et al.  Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..

[23]  P. Slater.  Enclaveless Sets and MK-Systems. , 1977, Journal of research of the National Bureau of Standards.

[24]  Henning Fernau,et al.  NONBLOCKER: Parameterized Algorithmics for minimum dominating set , 2006, SOFSEM.

[25]  Stephen T. Hedetniemi,et al.  On the computational complexity of upper fractional domination , 1990, Discret. Appl. Math..

[26]  Prasad Raghavendra,et al.  Improved Approximation Algorithms for the Spanning Star Forest Problem , 2011, Algorithmica.

[27]  Andrei V. Gagarin,et al.  A generalised upper bound for the k-tuple domination number , 2008, Discret. Math..