A Polynomial Kernel For Multicut In Trees

Details A Polynomial Kernel For Multicut In Trees A Polynomial Kernel For Multicut In Trees

2009-02-06

arxiv.org/abs/0902.1047v1

26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 183-194

Computer Science

Discrete Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Polynomial Kernel For Multicut In Trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Polynomial Kernel For Multicut In Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Polynomial Kernel For Multicut In Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-251580