Improved parameterized and exact algorithms for cut problems on trees

We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρk), where ρ=2+1<1.554 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 607; pp. 455 - 470
Main Authors: Kanj, Iyad, Lin, Guohui, Liu, Tian, Tong, Weitian, Xia, Ge, Xu, Jinhui, Yang, Boting, Zhang, Fenghui, Zhang, Peng, Zhu, Binhai
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.2015
Subjects:
Algorithms
Exact algorithm
Multicut
Multiway cut
Parameterized algorithm
Polynomials
Roots
Terminals
Tree
Trees
Tree
Multiway cut
Multicut
Parameterized algorithm
Exact algorithm
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the Multicut on Trees and the Generalized Multiway Cut on Trees problems. For the Multicut on Trees problem, we present a parameterized algorithm that runs in time O⁎(ρk), where ρ=2+1<1.554 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen et al. that runs in time O⁎(1.619k). For the 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 Generalized Multiway Cut on Trees problem to the Multicut on Trees problem, our results give a parameterized algorithm that solves the Generalized Multiway Cut on Trees problem in time O⁎(ρk).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2015.06.010