On the hardness of range assignment problems (Q3548718)
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: On the hardness of range assignment problems |
scientific article; zbMATH DE number 5383013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of range assignment problems |
scientific article; zbMATH DE number 5383013 |
Statements
On the hardness of range assignment problems (English)
0 references
17 December 2008
0 references
computational complexity
0 references
approximation algorithms
0 references
hardness of approximation
0 references
wireless networks
0 references
0 references
0.9799614548683168
0 references
0.8403724431991577
0 references
0.8348463177680969
0 references
0.8327407240867615
0 references
0.827684223651886
0 references
