An approximation algorithm for the \(H\)-prize-collecting power cover problem (Q6166874)
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 7722388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for the \(H\)-prize-collecting power cover problem |
scientific article; zbMATH DE number 7722388 |
Statements
An approximation algorithm for the \(H\)-prize-collecting power cover problem (English)
0 references
3 August 2023
0 references
power-cover problem
0 references
\(H\)-prize-collecting
0 references
approximation algorithm
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0.9041265845298768
0 references
0.8823702931404114
0 references
0.8271082639694214
0 references
0.8127836585044861
0 references
0.8044523000717163
0 references
