Abstract
We take a new look at the multicut problem in trees, denoted multicut on trees henceforth, through the eyes of the vertex cover problem. This connection, together with other techniques that we develop, allows us to give an upper bound of O(k3) on the kernel size for multicut on trees, significantly improving the O(k6) upper bound given by Bousquet et al. We exploit this connection further to present a parameterized algorithm for multicut on trees that runs in time O⁎(ρk), where ρ=(5+1)/2≈1.618. This improves the previous (time) upper bound of O⁎(2k), given by Guo and Niedermeier, for the problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
