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

@article{Demaine2005SubexponentialPA,
title={Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs},
author={E. Demaine and F. Fomin and M. Hajiaghayi and D. Thilikos},
journal={J. ACM},
year={2005},
volume={52},
pages={866-893}
}
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… Expand
265 Citations

#### Figures and Topics from this paper

Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
• Mathematics, Computer Science
• STACS
• 2013
This paper develops an algorithm running in O(2^{O((k log k)^{2/3})}n) time and polynomial space, where k is the size of the Steiner tree and n is the number of vertices of the graph. Expand
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
• Mathematics, Computer Science
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
All the results hold in fact on any class of graphs that exclude a fixed apex graph as a minor, in particular on graphs embeddable in any fixed surface. Expand
Fast Sub-exponential Algorithms and Compactness in Planar Graphs
A new theory, alternative to bidimensionality, of sub-exponential parameterized algorithms on planar graphs, which is based on the notion of compactness and proves that if a parameterized problem can be solved in cbranchwidth(G)nO(1) steps and is (r, q)-compact, then it can be solve by a crċ2.122ċ √ qċknO( 1) step algorithm. Expand
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
• Mathematics, Computer Science
• SWAT
• 2006
We give a general technique for designing fast subexponential algorithms for several graph problems whose instances are restricted to graphs of bounded genus. We use it to obtain timeExpand
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs
• S. Tazari
• Mathematics, Computer Science
• MFCS
• 2010
It is obtained as a corollary that all problems with a minor-monotone subexponential kernel and amenable to the technique can be solved inSubexponential FPT-time on H-minor free graphs, which results in a general methodology for subexp exponential parameterized algorithms outside the framework of bidimensionality. Expand
Subexponential algorithms for partial cover problems
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2011
The question affirmatively whether there is a subexponential algorithm for Partial Vertex Cover and Partial Dominating Set is answered by solving both problems in time 2^O(^k^)n^O^(^1^) not only on planar graphs but also on much larger classes of graphs, namely, apex-minor-free graphs. Expand
Genus characterizes the complexity of certain graph problems: Some tight results
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2007
We study the fixed-parameter tractability, subexponential time computability, and approximability of the well-known NP-hard problems: independent set, vertex cover, and dominating set. We deriveExpand
FPT algorithms for domination in sparse graphs and beyond
• Mathematics, Computer Science
• Theor. Comput. Sci.
• 2019
This paper shows that various domination problems are fixed-parameter tractable on biclique-free classes of graphs, including k -Dominating Set, which are shown to be FPT when parameterized by t + k, on graphs not containing K t, t as a subgraph. Expand
Linearity of grid minors in treewidth with applications through bidimensionality
• Mathematics, Computer Science
• Comb.
• 2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an Ω(w) × Ω(w) grid graph as a minor. Thus grid minors suffice to certify that H-minorfree graphs have large treewidth,Expand
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
• S. Tazari
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2012
It is obtained as a corollary that all problems with a minor-monotone subexponential kernel and amenable to the technique can be solved in subexp exponential FPT-time on H-minor free graphs, which results in a general methodology for subExponential parameterized algorithms outside the framework of bidimensionality. Expand

#### References

SHOWING 1-10 OF 63 REFERENCES
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
• Mathematics, Computer Science
• SODA '05
• 2005
We prove that any H-minor-free graph, for a fixed graph H, of treewidth ω has an Ω(ω) × Ω(ω) grid graph as a minor. Thus grid minors suffice to certify that H-minor-free graphs have large treewidth,Expand
The Bidimensional Theory of Bounded-Genus Graphs
• Mathematics, Computer Science
• MFCS
• 2004
This paper completes the theory of bidimensionality for graphs of bounded genus and shows that, for any problem whose solution value does not increase under contractions, the treewidth of any bounded-genus graph is at most a constant factor larger than the square root of the problem’s solution value on that graph. Expand
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors
• Mathematics, Computer Science
• Algorithmica
• 2004
A fixed-parameter algorithm that constructively solves the k-dominating set problem on any class of graphs excluding a single-crossing graph as a minor in O(4^{9.55\sqrt{k}}n^{O(1)})\$ time is presented. Expand
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2004
This paper demonstrates structural properties of larger classes of graphs and shows how to exploit the properties to derive polynomial-time algorithms for approximating treewidth and branchwidth and fixed-parameter algorithms for problems such as vertex cover, edge-dominating set, feedback vertex set, and others. Expand
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
• Mathematics, Computer Science
• APPROX
• 2002
This work gives polynomial-time constant-factor approximation algorithms for the treewidth and branchwidth of any H-minor-free graph for a given graph H with crossing number at most 1.5 to have several applications in designing fully polynometric-time approximation schemes and fixed-parameter algorithms for many NP-complete problems on these graphs. Expand
Bidimensionality: new connections between FPT algorithms and PTASs
• Mathematics, Computer Science
• SODA '05
• 2005
The notion of separators is replaced with a more powerful tool from the bidimensionality theory, enabling the first approach to apply to a much broader class of minimization problems than previously possible; and through the use of a structural backbone and thickening of layers it is demonstrated how the second approach can be applied to problems with a "nonlocal" structure. Expand
Embedding k-outerplanar graphs into ℓ1
• Computer Science, Mathematics
• SODA '03
• 2003
It is shown that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion, and hence also embedded into l1 with constant distort, implying a constant upper bound on the ratio between the sparsest cut and the maximum concurrent flow in multicommodity networks for k- outerplanar graphs. Expand
Bidimensional Parameters and Local Treewidth
• Mathematics, Computer Science
• LATIN
• 2004
This paper examines the question whether similar bounds can be obtained for larger minor-closed graph classes, and for general families of parameters including all the parameters where such a behavior has been reported so far. Expand
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
• Mathematics, Computer Science
• SODA '04
• 2004
The bound generalizes previously known linear bounds for special classes of graphs proved by several authors and obtains substantially faster polynomial-time approximation schemes for a broad class of problems in apex-minor-free graphs. Expand
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
• Mathematics, Computer Science
• ICALP
• 2003
It is shown that f(k, r) = 2O(r log r)√k, where the exponent of the exponential term grows sublinearly in the number of centers, and the same type of FPT algorithms can be designed for the more general class of map graphs introduced by Chen, Grigni, and Papadimitriou. Expand