An approximation algorithm for the submodular multicut problem in trees with linear penalties
Abstract
In this paper, we consider the submodular multicut problem in trees with linear penalties (SMCLP(T) problem). In the SMCLP(T) problem, we are given a tree null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null null...
Paper Details
Title
An approximation algorithm for the submodular multicut problem in trees with linear penalties
Published Date
Nov 14, 2020
Journal
Volume
15
Issue
4
Pages
1105 - 1112
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History