An FPT 2-Approximation for Tree-Cut Decomposition

Abstract : The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut width appears to be more adequate than treewidth as an invariant that, when bounded, can accelerate the resolution of intractable problems. While designing algorithms for problems with bounded tree-cut width, it is important to have a parametrically tractable way to compute the exact value of this parameter or, at least, some constant approximation of it. In this paper we give a parameterized 2-approximation algorithm for the computation of tree-cut width; for an input $n$-vertex graph $G$ and an integer $w$, our algorithm either confirms that the tree-cut width of $G$ is more than $w$ or returns a tree-cut decomposition of $G$ certifying that its tree-cut width is at most $2w$, in time $2^{O(w^2\log w)} \cdot n^2$. Prior to this work, no constructive parameterized algorithms, even approximated ones, existed for computing the tree-cut width of a graph. As a consequence of the Graph Minors series by Robertson and Seymour, only the existence of a decision algorithm was known.
Type de document :
Pré-publication, Document de travail
17 pages, 3 figures. 2016
Liste complète des métadonnées
Contributeur : Ignasi Sau <>
Soumis le : jeudi 11 février 2016 - 11:58:55
Dernière modification le : jeudi 11 janvier 2018 - 06:26:13


  • HAL Id : lirmm-01272709, version 1
  • ARXIV : 1509.04880


Eunjung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos. An FPT 2-Approximation for Tree-Cut Decomposition. 17 pages, 3 figures. 2016. 〈lirmm-01272709〉



Consultations de la notice