Combination Can Be Hard: Approximability of the Unique Coverage Problem (Q3395040): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q172552 / rank | |||
| Property / author | |||
| Property / author: Mohammad Taghi Hajiaghayi / rank | |||
| Property / author | |||
| Property / author: Uriel Feige / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Mohammad Taghi Hajiaghayi / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/060656048 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010916800 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:40, 19 March 2024
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
