Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (Q2480207)
From MaRDI portal
!
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 5255808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems |
scientific article; zbMATH DE number 5255808 |
Statements
Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems (English)
0 references
31 March 2008
0 references
bandwidth allocation
0 references
polyhedral combinatorics
0 references
0.9215934872627258
0 references
0.9131571650505066
0 references
0.8938063383102417
0 references
0.8860157132148743
0 references
0.7583705186843872
0 references
