Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties

Xiaofei Liu and Weidong Li ()
Additional contact information
Xiaofei Liu: Peking University
Weidong Li: Yunnan University

Journal of Combinatorial Optimization, No 0, 13 pages

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

Keywords: Multicut; Approximation algorithm; Submodular penalties; Primal-dual (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00568-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00568-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00568-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().