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 the normal view instead:
scientific article; zbMATH DE number 7660464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for \(P\)-prize-collecting set cover problem |
scientific article; zbMATH DE number 7660464 |
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
0.8476415872573853
0 references
0.8448086380958557
0 references
0.8204283118247986
0 references
0.8064014911651611
0 references
0.7918746471405029
0 references
