On connected dominating sets of restricted diameter

A connected dominating set (CDS) is commonly used to model a virtual backbone of a wireless network. To bound the distance that information must travel through the network, we explicitly restrict the diameter of a CDS to be no more than s leading to the concept of a dominating s-club. We prove that for any fixed positive integer s it is NP-complete to determine if a graph has a dominating s-club, even when the graph has diameter s+1. As a special case it is NP-complete to determine if a graph of diameter two has a dominating clique. We then propose a compact integer programming formulation for the related minimization problem, enhance the approach with variable fixing rules and valid inequalities, and present computational results.

[1]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

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

[3]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[4]  J. Mark Keil.  The Complexity of Domination Problems in Circle Graphs , 1993, Discret. Appl. Math..

[5]  Neng Fan,et al.  Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming , 2012, COCOA.

[6]  Dieter Kratsch,et al.  On Domination Problems for Permutation and Other Graphs , 1987, Theor. Comput. Sci..

[7]  Zsolt Tuza.  Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs , 2008, SIAM J. Discret. Math..

[8]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[9]  Dieter Kratsch,et al.  An exact algorithm for the minimum dominating clique problem , 2006, Theor. Comput. Sci..

[10]  Weili Wu,et al.  PTAS for Minimum Connected Dominating Set in Unit Ball Graph , 2008, WASA.

[11]  Di Yuan,et al.  Energy-efficient broadcasting in wireless ad hoc networks: performance benchmarking and distributed algorithms based on network connectivity characterization , 2005, MSWiM '05.

[12]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[13]  Sergiy Butenko,et al.  On clique relaxation models in network analysis , 2013, Eur. J. Oper. Res..

[14]  Dieter Kratsch,et al.  Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs , 1991, Discret. Math..

[15]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[16]  Fabrizio Grandoni,et al.  Solving Connected Dominating Set Faster than 2n , 2007, Algorithmica.

[17]  Dieter Kratsch,et al.  On the restriction of some NP-complete graph problems to permutation graphs , 1985, FCT.

[18]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[19]  Henning Fernau,et al.  An exact algorithm for the Maximum Leaf Spanning Tree problem , 2009, Theor. Comput. Sci..

[20]  Z. Tuza,et al.  Dominating cliques in P5-free graphs , 1990 .

[21]  Margaret B. Cozzens,et al.  Dominating cliques in graphs , 1991, Discret. Math..

[22]  Alexandre Salles da Cunha,et al.  The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm , 2011, INOC.

[23]  Abilio Lucena,et al.  Reformulations and solution algorithms for the maximum leaf spanning tree problem , 2010, Comput. Manag. Sci..

[24]  Gilbert Laporte,et al.  An exact algorithm for the maximum k-club problem in an undirected graph , 1999, Eur. J. Oper. Res..

[25]  Tetsuya Fujie,et al.  The maximum‐leaf spanning tree problem: Formulations and facets , 2004, Networks.

[26]  Oliver Schaudt,et al.  On dominating sets whose induced subgraphs have a bounded diameter , 2013, Discret. Appl. Math..

[27]  Alexander Veremyev,et al.  Identifying large robust network clusters via new compact formulations of maximum k-club problems , 2012, Eur. J. Oper. Res..

[28]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[29]  Sergiy Butenko,et al.  Novel Approaches for Analyzing Biological Networks , 2005, J. Comb. Optim..

[30]  Gábor Bacsó.  Complete description of forbidden subgraphs in the structural domination problem , 2009, Discret. Math..

[31]  R. J. Mokken,et al.  Cliques, clubs and clans , 1979 .

[32]  Panos M. Pardalos,et al.  A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks , 2004 .

[33]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[34]  L. Gewali,et al.  Generating quality dominating sets for sensor network , 2005, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05).