An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:26, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties |
scientific article |
Statements
An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (English)
0 references
10 May 2022
0 references
generalized prize-collecting Steiner forest problem
0 references
submodular function
0 references
primal-dual algorithm
0 references
