On distance r-dominating and 2r-independent sets in sparse graphs

Dvorak (2013) gave a bound on the minimum size of a distance r dominating set in the terms of the maximum size of a distance 2r independent set and generalized coloring numbers, thus obtaining a constant factor approximation algorithm for the parameters in any class of graphs with bounded expansion. We improve and clarify this dependence using an LP-based argument inspired by the work of Bansal and Umboh (2017).

[1]  Patrice Ossona de Mendez,et al.  Distributed Domination on Graph Classes of Bounded Expansion , 2017, SPAA.

[2]  Richard H. Schelp,et al.  Graphs with Linearly Bounded Ramsey Numbers , 1993, J. Comb. Theory, Ser. B.

[3]  Hal A. Kierstead,et al.  Planar Graph Coloring with an Uncooperative Partner , 1994, Planar Graphs.

[4]  Nikhil Bansal,et al.  Tight approximation bounds for dominating set on graphs of bounded arboricity , 2017, Inf. Process. Lett..

[5]  Hal A. Kierstead,et al.  Orderings on Graphs and Game Coloring Number , 2003, Order.

[6]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..

[7]  Zdenek Dvorak,et al.  Constant-factor approximation of domination number in sparse graphs , 2011, ArXiv.

[8]  David Zuckerman.  Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..

[9]  Christoph Lenzen,et al.  Minimum Dominating Set Approximation in Graphs of Bounded Arboricity , 2010, DISC.

[10]  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).

[11]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[12]  Ojas Parekh,et al.  Generalized Hypergraph Matching via Iterated Packing and Local Ratio , 2014, WAOA.

[13]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.