Local Tree-Width, Excluded Minors, and Approximation Algorithms

Authors:
Martin Grohe
Affiliations:
Humboldt-Universität zu Berlin, Institut für Informatik, Germany
Venue:
Combinatorica
Year:
2003

Citing 0
Cited 40

Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Towards a Predictive Computational Complexity Theory

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Learnability and Definability in Trees and Similar Structures

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Graph separators: a parameterized view

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Equivalence of local treewidth and linear local treewidth and its algorithmic applications

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences
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
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

ACM Transactions on Algorithms (TALG)
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
Object location using path separators

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth

Journal of Computer and System Sciences
Approximation algorithms via contraction decomposition

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computing excluded minors

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A linear-time algorithm to find a separator in a graph excluding a minor

ACM Transactions on Algorithms (TALG)
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Parameterized complexity of the smallest degree-constrained subgraph problem

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A shorter proof of the graph minor algorithm: the unique linkage theorem

Proceedings of the forty-second ACM symposium on Theory of computing
Decomposition, approximation, and coloring of odd-minor-free graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Faster approximation schemes and parameterized algorithms on H-minor-free and odd-minor-free graphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Minimum dominating set approximation in graphs of bounded arboricity

DISC'10 Proceedings of the 24th international conference on Distributed computing
Approximation of minimum weight spanners for sparse graphs

Theoretical Computer Science
Contraction decomposition in h-minor-free graphs and algorithmic applications

Proceedings of the forty-third annual ACM symposium on Theory of computing
A simpler algorithm and shorter proof for the graph minor decomposition

Proceedings of the forty-third annual ACM symposium on Theory of computing
Dealing with large hidden constants: engineering a planar steiner tree PTAS

Journal of Experimental Algorithmics (JEA)
Implicit branching and parameterized partial cover problems

Journal of Computer and System Sciences
Guard games on graphs: Keep the intruder out!

Theoretical Computer Science
Linear kernels for (connected) dominating set on H-minor-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized complexity of finding small degree-constrained subgraphs

Journal of Discrete Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs

Theoretical Computer Science
Bidimensionality and EPTAS

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

GD'04 Proceedings of the 12th international conference on Graph Drawing
Algorithms for graphs embeddable with few crossings per edge

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Local search: Is brute-force avoidable?

Journal of Computer and System Sciences
Structure theorem and isomorphism test for graphs with excluded topological subgraphs

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Subexponential parameterized algorithms

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The local tree-width of a graph G=(V,E) is the function ltwG :ℕ→ℕ that associates with every r∈ℕ the maximal tree-width of an r-neighborhood in G. Our main grapht heoretic result is a decomposition theorem for graphs with excluded minors, which says that such graphs can be decomposed into trees of graphs of almost bounded local tree-width.As an application of this theorem, we show that a number of combinatorial optimization problems, suchas Minimum Vertex Cover, Minimum Dominating Set, and Maximum Independent Set have a polynomial time approximation scheme when restricted to a class of graphs with an excluded minor.