The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Quickly excluding a planar graph
Journal of Combinatorial Theory Series B
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Wavelength conversion in optical networks
Journal of Algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Approximation algorithms for partial covering problems
Journal of Algorithms
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Approximation Schemes for First-Order Definable Optimisation Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
SIAM Journal on Computing
New upper bounds on the decomposability of planar graphs
Journal of Graph Theory
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Survey: Subexponential parameterized algorithms
Computer Science Review
The Bidimensionality Theory and Its Algorithmic Applications 1
The Computer Journal
Contraction obstructions for treewidth
Journal of Combinatorial Theory Series B
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Linear kernels for (connected) dominating set on H-minor-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
On the complexity of metric dimension
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
European Journal of Combinatorics
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Data reduction for graph coloring problems
Information and Computation
Hi-index | 0.00 |
Bidimensionality theory appears to be a powerful framework for the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005] as a tool to obtain sub-exponential time parameterized algorithms for problems on H-minor free graphs. Demaine and Hajiaghayi [SODA 2005] extended the theory to obtain polynomial time approximation schemes (PTASs) for bidimensional problems, and subsequently improved these results to EPTASs. Fomin et. al [SODA 2010] established a third meta-algorithmic direction for bidimensionality theory by relating it to the existence of linear kernels for parameterized problems. In this paper we revisit bidimensionality theory from the perspective of approximation algorithms and redesign the framework for obtaining EPTASs to be more powerful, easier to apply and easier to understand. One of the important conditions required in the framework developed by Demaine and Hajiaghayi [SODA 2005] is that to obtain an EPTAS for a graph optimization problem Π, we have to know a constant-factor approximation algorithm for Π. Our approach eliminates this strong requirement, which makes it amenable to more problems. At the heart of our framework is a decomposition lemma which states that for "most" bidimensional problems, there is a polynomial time algorithm which given an H-minor-free graph G as input and an ∈ 0 outputs a vertex set X of size ∈ · OPT such that the treewidth of G\X is O(1/∈). Here, OPT is the objective function value of the problem in question This allows us to obtain EPTASs on (apex)-minor-free graphs for all problems covered by the previous framework, as well as for a wide range of packing problems, partial covering problems and problems that are neither closed under taking minors, nor contractions. To the best of our knowledge for many of these problems including Cycle Packing, Vertex-H-Packing, Maximum Leaf Spanning Tree, and Partial r-Dominating Set no EPTASs on planar graphs were previously known.