Skip to Main content Skip to Navigation

Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe.

Jean Daligault 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This thesis tackles NP-hard problems with combinatorial techniques, focusing on the framework of Fixed-Parameter Tractability. Themain problems considered here are MULTICUT and MAXIMUM LEAF OUT-BRANCHING. MULTICUT is a natural generalisation of the cut problem, and consists in simultaneously separating prescribed pairs of vertices by removing as few edges as possible in a graph. MAXIMUM LEAF OUT-BRANCHING consists in finding a spanning directed tree with as many leaves as possible in a directed graph. The main results of this thesis are the following. We show that MULTICUT is FPT when parameterized by the solution size, i.e. deciding the existence of a multicut of size k in a graph with n vertices can be done in time f(k) ∗ poly(n). We show that MULTICUT IN TREES admits a polynomial kernel, i.e. can be reduced to instances of size polynomial in k. We give anO∗(3.72k) algorithmforMAXIMUM LEAF OUT-BRANCHING and the first non-trivial (better than 2n) exact algorithm. We also provide a quadratic kernel and a constant factor approximation algorithm. These algorithmic results are based on combinatorial results and structural properties, involving tree decompositions,minors, reduction rules and s−t numberings, among others. We present results obtained with combinatorial techniques outside the scope of parameterized complexity: a characterization of Helly circle graphs as the diamond-free circle graphs, and a partial characterisation of 2-well-quasi-ordered classes of graphs.
Document type :
Complete list of metadatas

Cited literature [114 references]  Display  Hide  Download
Contributor : Benjamin Lévêque <>
Submitted on : Monday, March 25, 2013 - 2:39:40 PM
Last modification on : Friday, May 17, 2019 - 11:39:40 AM
Long-term archiving on: : Wednesday, June 26, 2013 - 4:01:24 AM


  • HAL Id : tel-00804206, version 1



Jean Daligault. Techniques combinatoires pour les algorithmes paramétrés et les noyaux, avec applications aux problèmes de multicoupe.. Discrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2011. English. ⟨tel-00804206⟩



Record views


Files downloads