An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (Q2205937): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3042489864 / rank | |||
Normal rank | |||
Revision as of 22:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem |
scientific article |
Statements
An approximation algorithm for the \(k\)-prize-collecting multicut on a tree problem (English)
0 references
21 October 2020
0 references
multicut
0 references
\(k\)-prize-collecting multicut
0 references
approximation algorithm
0 references
primal-dual algorithm
0 references
Lagrange relaxation
0 references
