Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (Q2082211): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-020-00568-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-020-00568-2 / rank | |||
Normal rank | |||
Latest revision as of 00:06, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties |
scientific article |
Statements
Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties (English)
0 references
4 October 2022
0 references
multicut
0 references
approximation algorithm
0 references
submodular penalties
0 references
primal-dual
0 references
0 references
0 references
0 references
