An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:57, 3 February 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
