An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties (Q2136518): 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.1007/s40305-021-00355-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3188073793 / rank | |||
Normal rank | |||
Revision as of 23:26, 19 March 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
