The Bidimensionality Theory and Its Algorithmic Applications

Abstract

Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NPhard graph problems in broad classes of graphs. This theory applies to graph problems that are bidimensional in the sense that (1) the solution value for the k x k grid graph (and similar graphs) grows with k, typically as Q(k 2 ), and (2) the solution value goes down when contracting edges and optionally when deleting edges. Examples of such problems include feedback vertex set, vertex cover, minimum maximal matching, face cover, a series of vertexremoval parameters, dominating set, edge dominating set, r-dominating set, connected dominating set, connected edge dominating set, connected r-dominating set, and unweighted TSP tour (a walk in the graph visiting all vertices). Bidimensional problems have many structural properties; for example, any graph embeddable in a surface of bounded genus has treewidth bounded above by the square root of the problem's solution value. These properties lead to efficient-often subexponential-fixed-parameter algorithms, as well as polynomial-time approximation schemes, for many minor-closed graph classes. One type of minor-closed graph class of particular relevance has bounded local treewidth, in the sense that the treewidth of a graph is bounded above in terms of the diameter; indeed, we show that such a bound is always at most linear. The bidimensionality theory unifies and improves several previous results. The theory is based on algorithmic and combinatorial extensions to parts of the Robertson-Seymour Graph Minor Theory, in particular initiating a parallel theory of graph contractions. The foundation of this work is the topological theory of drawings of graphs on surfaces and our results regarding the relation (the linearity) of the size of the largest grid minor in terms of treewidth in bounded-genus graphs and more generally in graphs excluding a fixed graph H as a minor.In this thesis, we also develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into L 1 (and even Euclidean embeddings) are insufficient, but that the additional structure provided by many embedding theorems does suffice for our purposes. We obtain an O( lo-gn) approximation for min-ratio vertex cuts in general graphs, based on a new semidefinite relaxation of the problem, and a tight analysis of the integrality gap which is shown to be O('Iogn).We also prove various approximate max-flow/min-vertex-3 cut theorems, which in particular give a constant-factor approximation for min-ratio vertex cuts in any excluded-minor family of graphs. Previously, this was known only for planar graphs, and for general excluded-minor families the best-known ratio was O(log n). These results have a number of applications. We exhibit an O(Vlo/g) pseudo-approximation for finding balanced vertex separators in general graphs. Furthermore, we obta...

Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal

“…Similar algorithms, with running times on the form O * (c tw(G) ) for a constant c, are known for many other graph problems such as DOMINATING SET, q-COLORING and ODD CYCLE TRANSVERSAL [1,9,10,27]. Algorithms for graph problems on bounded treewidth graphs have found many uses as subroutines in approximation algorithms [7,8], parameterized algorithms [6,19,26], and exact algorithms [12,23,28].…”

Exact Algorithms for Intervalizing Coloured Graphs

“…Namely, the algorithm uses slightly less than exponential time. Most NP-hard problems that have subexponential algorithms deal with planar graphs and generalizations of planar graphs, see e.g., [12,16,23]. Typically, the running time of such algorithms is of the form 2 O( √ n) .…”

Contraction decomposition in h-minor-free graphs and algorithmic applications

“…However, this decomposition approach is effectively limited to problems whose optimal solution only improves when deleting edges or vertices from the graph. Bidimensionality theory [10] highlights contracted-closed problems, whose optimal solution only improves when contracting edges (but not necessarily when deleting edges), including classic problems such as dominating set (and its variations), minimum chordal completion, and the Traveling Salesman Problem (TSP).…”