An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (Q6620014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties |
scientific article; zbMATH DE number 7927449
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties |
scientific article; zbMATH DE number 7927449 |
Statements
An approximation algorithm for the \(\boldsymbol{K}\)-prize-collecting multicut problem in trees with submodular penalties (English)
0 references
16 October 2024
0 references
multicut problem in trees with submodular penalties
0 references
\(K\) prize collecting
0 references
approximation algorithm
0 references
primal-dual scheme
0 references
0 references
0 references
0 references
0 references
