Combinatorial Optimization on Graphs of Bounded Treewidth

  title={Combinatorial Optimization on Graphs of Bounded Treewidth},
  author={Hans L. Bodlaender and Arie M. C. A. Koster},
  journal={Comput. J.},
There are many graph problems that can be solved in linear or polynomial time with a dynamic programming algorithm when the input graph has bounded treewidth. For combinatorial optimization problems, this is a useful approach for obtaining fixed-parameter tractable algorithms. Starting from trees and series-parallel graphs, we introduce the concepts of treewidth and tree decompositions, and illustrate the technique with the Weighted Independent Set problem as an example. The paper surveys some… 

Figures from this paper

A Local Search Algorithm for Branchwidth

The first local search algorithm for branch decompositions of small width of given graphs is given using non-trivial combinatorial properties of the neighbourhood space, and it is shown that significant reductions in the search space can be obtained.

Fast Algorithms for Join Operations on Tree Decompositions

This paper focuses on graphs of bounded treewidth, a measure of how tree-like a graph is, and dynamic programming algorithms using the structure of a tree decomposition of the graph.

Solving Treewidth in graphs using MaxSAT

In this document, a survey on algorithms for solving the treewidth value of an arbitrary input graph with emphasis on the usage of SAT and MaxSAT formalizations is provided and a proposal to reduce and approximate well-known NP-Hard problems is outlined.

Treewidth computations I. Upper bounds

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

It is shown that the aforementioned gap cannot be breached for some problems that aim to maximize the number of connected components like Cycle Packing, and in several cases it is able to show that improving those constants would cause the Strong Exponential Time Hypothesis to fail.

Cut&Count technique for graph connectivity problems parameterized by treewidth

This dissertation breaches the gap between standard dynamic programming techniques and reality by introducing a novel technique called Cut&Count that allows to produce ctw|V |O(1) time Monte Carlo algorithms for most connectivity-type problems, including HAMILTONIAN CYCLE, STEINER TREE, FEEDBACK VERTEX SET and CONNECTED VERTex COVER.

J un 2 01 8 Fast Dynamic Programming on Graph Decompositions ∗

The main techniques used in this paper are a generalisation of fast subset convolution, as introduced by Björklund et al., now applied in the setting of graph decompositions and augmented such that multiple states and multiple ranks can be used.

A comparison of two approaches for polynomial time algorithms computing basic graph parameters

This paper gives polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graph of bounded clique-width in polynometric time.

A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth

An algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth, which are NP-hard in general, but solvable in linear time on this type of graphs.

Towards systematic parallel programming of graph problems via tree decomposition and tree parallelism

This paper proposes a novel programming framework which provides a user-friendly programming interface and automatic in-black-box parallelization, and derives bottom-up dynamic programming algorithms on tree decompositions from the user-specified GTA algorithms.



New Lower and Upper Bounds for Graph Treewidth

New lower and upper bounds for the treewidth are proposed and tested on the well known DIMACS benchmark for graph coloring, and the heuristic method computes good bounds within a very small computing time.

Reduction Algorithms for Graphs of Small Treewidth

It is shown that the reduction method can be extended to solve the construction variants of many decision problems on graphs of bounded treewidth, including all problems definable in monadic second order logic.

Linear time algorithms for NP-hard problems restricted to partial k-trees

A Complete Anytime Algorithm for Treewidth

A new algorithm called minor-min-width for computing a lower bound on treewidth that is used within the branch and bound algorithm and which improves over earlier available lower bounds.

Approximation Algorithms for Treewidth

The first polynomial-time algorithm that approximates the optimal by a factor that does not depend on n, the number of nodes in the input graph is presented, and it is reported on experimental results confirming the effectiveness of the algorithms for large graphs associated with real-world problems.

Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs

Graph Minors. II. Algorithmic Aspects of Tree-Width

Heuristic and metaheuristic methods for computing graph treewidth

This paper proposes two new methods for computing the treewidth of graphs: a heuristic and a metaheuristic, which returns good results in a short computation time, and identifies properties of the triangulation process to optimize the computing time of the method.

Degree-Based Treewidth Lower Bounds

Computer experiments show that combining the treewidth lower bounds with minors can considerably improve the lower bounds, and heuristic algorithms for those parameters that are N P-hard to compute are developed.

Treewidth Lower Bounds with Brambles

Two algorithms are given: one for general graphs, and one for planar graphs that are shown to give a lower bound for both the treewidth and branchwidth that is at most a constant factor away from the optimum.