Resource allocation in bounded degree trees (Q1024215)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5565301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Resource allocation in bounded degree trees |
scientific article; zbMATH DE number 5565301 |
Statements
Resource allocation in bounded degree trees (English)
0 references
16 June 2009
0 references
approximation algorithms
0 references
bandwidth allocation
0 references
bounded degree trees
0 references
scheduling
0 references
storage allocation
0 references
0.9999996
0 references
0.9056814
0 references
0.8934646
0 references
0.8889923
0 references
0.87908864
0 references
0.87737554
0 references
0.8700729
0 references
0 references
0 references
0.8647139
0 references
