Abstract
In this paper, we consider the k-prize-collecting multicut on a tree (k-PCM(T)) problem. In this problem, we are given an undirected tree T=(V,E), a set of m distinct pairs of vertices P={(s1,t1),…,(sm,tm)} and a parameter k with k≤m. Every edge in E has a nonnegative cost ce. Every pair (si,ti) in P has a nonnegative penalty cost πi. Our goal is to find a multicut M that separates at least k pairs in P such that the total cost, including the edge cost of the multicut M and the penalty cost of the pairs not separated by M, is minimized. This problem generalizes the well-known multicut on a tree problem. Our main work is to present a (4+ε)-approximation algorithm for the k-PCM(T) problem via the methods of primal-dual and Lagrangean relaxation, where ε is any fixed positive number.
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.
