Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

We introduce a new framework for designing fixed-parameter algorithms with subexponential running time---2O(&kradic;) nO(1). Our results apply to a broad family of graph problems, called bidimensional problems, which includes many domination and problems such as vertex cover, feedback vertex set, minimum maximal matching, dominating set, edge dominating set, disk dimension, and many others restricted to bounded-genus graphs (phrased as bipartite-graph problem). Furthermore, it is fairly straightforward to prove that a problem is bidimensional. In particular, our framework includes, as special cases, all previously known problems to have such subexponential algorithms. Previously, these algorithms applied to planar graphs, single-crossing-minor-free graphs, and/or map graphs; we extend these results to apply to bounded-genus graphs as well. In a parallel development of combinatorial results, we establish an upper bound on the treewidth (or branchwidth) of a bounded-genus graph that excludes some planar graph H as a minor. This bound depends linearly on the size ¦V(H)¦ of the excluded graph H and the genus g(G) of the graph G, and applies and extends the graph-minors work of Robertson and Seymour.Building on these results, we develop subexponential fixed-parameter algorithms for dominating set, vertex cover, and set cover in any class of graphs excluding a fixed graph H as a minor. In particular, this general category of graphs includes planar graphs, bounded-genus graphs, single-crossing-minor-free graphs, and any class of graphs that is closed under taking minors. Specifically, the running time is 2O(&kracic;) nh, where h is a constant depending only on H, which is polynomial for k = O(log2 n). We introduce a general approach for developing algorithms on H-minor-free graphs, based on structural results about H-minor-free graphs at the heart of Robertson and Seymour's graph-minors work. We believe this approach opens the way to further development on problems in H-minor-free graphs.

[1]  Erik D. Demaine,et al.  Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors , 2005, Algorithmica.

[2]  Fabrizio Grandoni,et al.  Refined memorization for vertex cover , 2005, Inf. Process. Lett..

[3]  Gregory Gutin,et al.  Kernels in planar digraphs , 2005, J. Comput. Syst. Sci..

[4]  Martin Grohe.  Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2003, Comb..

[5]  A. Sahai,et al.  Dimension Reduction in the l 1 norm , 2002 .

[6]  Paul D. Seymour,et al.  Graph Minors. XI. Circuits on a Surface , 1994, J. Comb. Theory, Ser. B.

[7]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[8]  Ljubomir Perkovic,et al.  Improved Parameterized Algorithms for Planar Dominating Set , 2002, MFCS.

[9]  Amit Sahai,et al.  Dimension reduction in the /spl lscr//sub 1/ norm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[10]  Michael R. Fellows,et al.  The dominating set problem is fixed parameter tractable for graphs of bounded genus , 2004, J. Algorithms.

[11]  Eyal Amir,et al.  Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.

[12]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[13]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

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

[15]  Erik D. Demaine,et al.  Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality , 2005, SODA '05.

[16]  Dimitrios M. Thilikos,et al.  Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.

[17]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2004, J. Algorithms.

[18]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.

[19]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[20]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[21]  Erik D. Demaine,et al.  Bidimensional Parameters and Local Treewidth , 2004, LATIN.

[22]  Bruce A. Reed,et al.  Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.

[23]  Anupam Gupta,et al.  Cuts, Trees and ℓ1-Embeddings of Graphs* , 2004, Comb..

[24]  Erik D. Demaine,et al.  Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs , 2003, ICALP.

[25]  Rolf Niedermeier,et al.  Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.

[26]  Ton Kloks,et al.  New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs , 2002, WG.

[27]  Erik D. Demaine,et al.  The Bidimensional Theory of Bounded-Genus Graphs , 2004, SIAM J. Discret. Math..

[28]  Erik D. Demaine,et al.  Diameter and Treewidth in Minor-Closed Graph Families, Revisited , 2004, Algorithmica.

[29]  Paul D. Seymour,et al.  Graph Minors .XII. Distance on a Surface , 1995, J. Comb. Theory, Ser. B.

[30]  Michael R. Fellows,et al.  Parameterized Complexity: The Main Ideas and Some Research Frontiers , 2009, ISAAC.

[31]  Dimitrios M. Thilikos,et al.  Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up , 2004, ICALP.

[32]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[33]  Michael R. Fellows,et al.  The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus , 2002, SWAT.

[34]  Liming Cai,et al.  On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..

[35]  Robin Thomas,et al.  Excluding a Countable Clique , 1999, J. Comb. Theory, Ser. B.

[36]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[37]  Paul D. Seymour,et al.  Excluding a graph with one crossing , 1991, Graph Structure Theory.

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

[39]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[40]  Erik D. Demaine,et al.  Approximation algorithms for classes of graphs excluding single-crossing graphs as minors , 2004, J. Comput. Syst. Sci..

[41]  Ton Kloks,et al.  Maximum Clique Transversals , 2001, WG.

[42]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

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

[44]  Erik D. Demaine,et al.  -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor , 2002, APPROX.

[45]  Anupam Gupta,et al.  Embedding k-outerplanar graphs into ℓ1 , 2003, SODA '03.

[46]  Erik D. Demaine,et al.  Equivalence of local treewidth and linear local treewidth and its algorithmic applications , 2004, SODA '04.

[47]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[48]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[49]  Thomas Böhme,et al.  Ka, k Minors in Graphs of Bounded Tree-Width , 2002, J. Comb. Theory, Ser. B.

[50]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[51]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[52]  Satish Rao,et al.  Shallow excluded minors and improved graph decompositions , 1994, SODA '94.

[53]  Jörg Flum,et al.  The Parameterized Complexity of Counting Problems , 2004, SIAM J. Comput..

[54]  Erik D. Demaine,et al.  Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.