Abstract
In this paper, we introduce the submodular multicut problem in trees with submodular penalties, which generalizes the prize-collecting multicut problem in trees and the submodular vertex cover with submodular penalties. We present a combinatorial approximation algorithm, based on the primal-dual algorithm for the submodular set cover problem. In addition, we present a combinatorial 3-approximation algorithm for a special case where the edge cost is a modular function, based on the primal-dual scheme for the multicut problem in trees.
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.
