The many facets of upper domination

This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.

[1]  Yoichi Iwata,et al.  A Faster Algorithm for Dominating Set Analyzed by the Potential Method , 2011, IPEC.

[2]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[3]  Henning Fernau,et al.  A novel parameterised approximation algorithm for minimum vertex cover , 2013, Theor. Comput. Sci..

[4]  Henning Fernau,et al.  Data reductions and combinatorial bounds for improved approximation algorithms , 2016, J. Comput. Syst. Sci..

[5]  Fedor V. Fomin,et al.  Reports in Informatics , 2005 .

[6]  Joachim Kneis,et al.  A Fine-grained Analysis of a Simple Independent Set Algorithm , 2009, FSTTCS.

[7]  Vadim V. Lozin,et al.  A Dichotomy for Upper Domination in Monogenic Classes , 2014, COCOA.

[8]  Michael S. Jacobson,et al.  Chordal graphs and upper irredundance, upper domination and independence , 1991, Discret. Math..

[9]  Magnús M. Halldórsson,et al.  Approximating the Minimum Maximal Independence Number , 1993, Inf. Process. Lett..

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

[11]  Vangelis Th. Paschos,et al.  Fast Algorithms for min independent dominating set , 2010, SIROCCO.

[12]  Johan Håstad,et al.  Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[13]  Odile Favaron,et al.  Contributions to the theory of domination, independence and irredundance in graphs , 1981, Discret. Math..

[14]  Stephen T. Hedetniemi,et al.  Linear-time Computability of Combinatorial Problems on Generalized-Series-Parallel Graphs , 1987 .

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

[16]  Hans L. Bodlaender,et al.  Exact algorithms for dominating set , 2011, Discret. Appl. Math..

[17]  Jonas Holmerin,et al.  Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.

[18]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[19]  Henning Fernau,et al.  Breaking the 2n-barrier for Irredundance: Two lines of attack , 2011, J. Discrete Algorithms.

[20]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[21]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[22]  Meirav Zehavi.  Maximum Minimal Vertex Cover Parameterized by Vertex Cover , 2015, MFCS.

[23]  Steven Skiena,et al.  The Lazy Bureaucrat scheduling problem , 1999, Inf. Comput..

[24]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, STACS.

[25]  Steven Skiena,et al.  The Lazy Bureaucrat Scheduling Problem , 1999, WADS.

[26]  Fabrizio Grandoni,et al.  Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications , 2008, TALG.

[27]  Krzysztof Pietrzak,et al.  On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems , 2003, J. Comput. Syst. Sci..

[28]  Qizhi Fang.  On the computational complexity of upper total domination , 2004, Discret. Appl. Math..

[29]  Lhouari Nourine,et al.  On the Enumeration of Minimal Dominating Sets and Related Notions , 2014, SIAM J. Discret. Math..

[30]  Vangelis Th. Paschos,et al.  Algorithmic Aspects of Upper Domination: A Parameterised Perspective , 2016, AAIM.

[31]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[32]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[33]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[34]  Jan Kratochvíl.  A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness , 1994, Discret. Appl. Math..

[35]  Amr Elmasry,et al.  Multipartite priority queues , 2008, TALG.

[36]  Michael A. Bender,et al.  Scheduling algorithms for procrastinators , 2008, J. Sched..

[37]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[38]  Michael R. Fellows,et al.  The complexity of irredundant sets parameterized by size , 2000, Discret. Appl. Math..

[39]  Johann Hurink,et al.  Approximating minimum independent dominating sets in wireless networks , 2007, Inf. Process. Lett..

[40]  P. Hammer,et al.  Dual subimplicants of positive Boolean functions , 1998 .

[41]  Vangelis Th. Paschos,et al.  Upper Domination: Complexity and Approximation , 2016, IWOCA.

[42]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[43]  Vangelis Th. Paschos,et al.  On the max min vertex cover problem , 2015, Discret. Appl. Math..

[44]  Marco Cesati,et al.  The Turing way to parameterized complexity , 2003, J. Comput. Syst. Sci..

[45]  L. Lovász.  Three short proofs in graph theory , 1975 .

[46]  Vadim V. Lozin,et al.  A Boundary Property for Upper Domination , 2016, IWOCA.

[47]  Michael A. Henning,et al.  Inequalities relating domination parameters in cubic graphs , 1996, Discret. Math..