Approximation hardness of dominating set problems in bounded degree graphs

We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various kinds of domination problems (connected, total, independent) in bounded degree graphs. Asymptotically, for degree bound approaching infinity, these bounds almost match the known upper bounds. The results are applied to improve the lower bounds for other related problems such as Maximum Induced Matching and Maximum Leaf Spanning Tree.

[1]  Max Planck,et al.  Complexity of approximating bounded variants of optimization problems , 2008 .

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

[3]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

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

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

[6]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[7]  Rong-chii Duh,et al.  Approximation of k-set cover by semi-local optimization , 1997, STOC '97.

[8]  David Manlove,et al.  On the approximability of the maximum induced matching problem , 2005, J. Discrete Algorithms.

[9]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[10]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[11]  F. Bruce Shepherd,et al.  Bipartite Domination and Simultaneous Matroid Covers , 2003, SIAM J. Discret. Math..

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

[13]  Hsueh-I Lu,et al.  The Power of Local Optimization: Approximation Algorithms for Maximum-Leaf Spanning Tree , 2007 .

[14]  Francesco Maffioli,et al.  A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

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

[16]  Michele Zito.  Induced Matchings in Regular Graphs and Trees , 1999, WG.

[17]  Robert W. Irving.  On Approximating the Minimum Independent Dominating Set , 1991, Inf. Process. Lett..

[18]  Miroslav Chlebík,et al.  Approximation hardness of edge dominating set problems , 2006, J. Comb. Optim..

[19]  Tiziana Calamoneri,et al.  Improved Approximations of Independent Dominating Set in Bounded Degree Graphs , 1996, WG.