1 research outputs found
Algorithms for Cut Problems on Trees
We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on
trees} problems. For the {\sc multicut on trees} problem, we present a
parameterized algorithm that runs in time , where is the positive root of the polynomial
. This improves the current-best algorithm of Chen et al. that runs
in time . For the {\sc generalized multiway cut on trees}
problem, we show that this problem is solvable in polynomial time if the number
of terminal sets is fixed; this answers an open question posed in a recent
paper by Liu and Zhang. By reducing the {\sc generalized multiway cut on trees}
problem to the {\sc multicut on trees} problem, our results give a
parameterized algorithm that solves the {\sc generalized multiway cut on trees}
problem in time , where time