License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1824
URN: urn:nbn:de:0030-drops-18247
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/1824/
Go to the corresponding LIPIcs Volume Portal

Bousquet, Nicolas ; Daligault, Jean ; Thomasse, Stephan ; Yeo, Anders

A Polynomial Kernel for Multicut in Trees

pdf-format:
09001.BousquetNicolas.1824.pdf (0.2 MB)

Abstract

The {\sc 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 (2005). They also provided an exponential kernel. They asked whether this problem has a polynomial kernel. This question was also raised by Fellows (2006).

We show that {\sc Multicut In Trees} has a polynomial kernel.

BibTeX - Entry

@InProceedings{bousquet_et_al:LIPIcs:2009:1824,
  author =	{Nicolas Bousquet and Jean Daligault and Stephan Thomasse and Anders Yeo},
  title =	{{A Polynomial Kernel for Multicut in Trees}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{183--194},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Susanne Albers and Jean-Yves Marion},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1824},
  URN =		{urn:nbn:de:0030-drops-18247},
  doi =		{10.4230/LIPIcs.STACS.2009.1824},
  annote =	{Keywords: }
}

Collection: 26th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2009
Date of publication: 19.02.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI