Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combination Can Be Hard: Approximability of the Unique Coverage Problem |
scientific article |
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
