Minimizing flow time in the wireless gathering problem (Q3189016)
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: Minimizing flow time in the wireless gathering problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing flow time in the wireless gathering problem |
scientific article |
Statements
Minimizing flow time in the wireless gathering problem (English)
0 references
9 September 2014
0 references
wireless networks
0 references
approximation algorithms
0 references
data gathering
0 references
local algorithms
0 references
1.0000004
0 references
0.9128159
0 references
0.9128159
0 references
0.9016134
0 references
0.90161335
0 references
0.8817895
0 references
0 references
