Packing-based approximation algorithm for the \(k\)-set cover problem (Q3104644)
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 5988672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing-based approximation algorithm for the \(k\)-set cover problem |
scientific article; zbMATH DE number 5988672 |
Statements
Packing-Based Approximation Algorithm for the k-Set Cover Problem (English)
0 references
16 December 2011
0 references
0.8698250651359558
0 references
0.8651108741760254
0 references
0.8409459590911865
0 references
0.8405858874320984
0 references
0.8393176198005676
0 references
