A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
From MaRDI portal
Publication:5389976
DOI10.4230/LIPIcs.STACS.2009.1824zbMath1236.68104MaRDI QIDQ5389976
Anders Yeo, Jean Daligault, Steéphan Thomassé, Nicolas Bousquet
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_1091.html
Related Items
Multicut Is FPT, Parameterized complexity of weighted multicut in trees, Parameterized complexity of multicut in weighted trees, Parameterized complexity dichotomy for \textsc{Steiner Multicut}, Multicut in trees viewed through the eyes of vertex cover, Kernels for feedback arc set in tournaments, Improved parameterized and exact algorithms for cut problems on trees, Query-competitive algorithms for cheapest set problems under uncertainty, Constant ratio fixed-parameter approximation of the edge multicut problem, On the generalized multiway cut in trees problem, Kernelization: New Upper and Lower Bound Techniques