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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 607; s. 455 - 470
Hlavní autori:	Kanj, Iyad, Lin, Guohui, Liu, Tian, Tong, Weitian, Xia, Ge, Xu, Jinhui, Yang, Boting, Zhang, Fenghui, Zhang, Peng, Zhu, Binhai
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!