An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for \(P\)-prize-collecting set cover problem |
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
