Approximation algorithm for partial set multicover versus full set multicover (Q4634530)
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 6857916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for partial set multicover versus full set multicover |
scientific article; zbMATH DE number 6857916 |
Statements
Approximation algorithm for partial set multicover versus full set multicover (English)
0 references
10 April 2018
0 references
partial set multicover
0 references
greedy algorithm
0 references
performance ratio
0 references
0.8909395337104797
0 references
0.8830425143241882
0 references
0.8310450315475464
0 references
0.8188780546188354
0 references
0.817432165145874
0 references
