An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689): 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-00364-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3194671897 / rank | |||
Normal rank | |||
Revision as of 19:19, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for \(P\)-prize-collecting set cover problem |
scientific article |
Statements
An approximation algorithm for \(P\)-prize-collecting set cover problem (English)
0 references
7 March 2023
0 references
\(P\)-prize-collecting set cover problem
0 references
approximation algorithm
0 references
primal-dual
0 references
Lagrangian relaxation
0 references
