An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344)
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 7799982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem |
scientific article; zbMATH DE number 7799982 |
Statements
An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (English)
0 references
5 February 2024
0 references
primal-dual
0 references
power cover
0 references
penalty cost
0 references
approximation algorithm
0 references
0 references
0 references
0 references
0.9531759023666382
0 references
0.9041265845298768
0 references
0.8483545780181885
0 references
0.843953013420105
0 references
0.824845016002655
0 references
