A Polynomial Kernel For Multicut In Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

A Polynomial Kernel For Multicut In Trees


The MULTICUT IN TREES problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer k, whether there exists a set of k edges cutting all the requests. This problem was shown to be FPT by Guo and Niedermeyer. They also provided an exponential kernel. They asked whether this problem has a polynomial kernel. This question was also raised by Fellows. We show that MULTICUT IN TREES has a polynomial kernel.
Fichier principal
Vignette du fichier
Bousquet_new.pdf (200.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359171 , version 1 (06-02-2009)


  • HAL Id : inria-00359171 , version 1
  • ARXIV : 0902.1047


Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo. A Polynomial Kernel For Multicut In Trees. STACS'2009: 26th International Symposium on Theoretical Aspects of Computer Science, Feb 2009, Freiburg, Germany. pp.183-194. ⟨inria-00359171⟩
209 View
178 Download



Gmail Facebook X LinkedIn More