A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems |
scientific article |
Statements
A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (English)
0 references
10 May 2019
0 references
approximation algorithm
0 references
primal-dual algorithm
0 references
\(k\)-prize collecting Steiner tree problems
0 references
\(k\)-prize collecting traveling salesman problems
0 references
