Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combination Can Be Hard: Approximability of the Unique Coverage Problem |
scientific article; zbMATH DE number 5597437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combination Can Be Hard: Approximability of the Unique Coverage Problem |
scientific article; zbMATH DE number 5597437 |
Statements
Combination Can Be Hard: Approximability of the Unique Coverage Problem (English)
0 references
20 August 2009
0 references
unique coverage
0 references
hardness of approximation
0 references
wireless networks
0 references
0.8465129733085632
0 references
0.843864381313324
0 references
0.7939621806144714
0 references
0.7887735962867737
0 references
0.7708916068077087
0 references
