(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436)
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: (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation |
scientific article; zbMATH DE number 6236744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation |
scientific article; zbMATH DE number 6236744 |
Statements
(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (English)
0 references
9 December 2013
0 references
online OVSF code assignment problem
0 references
resource augmentation
0 references
competitive algorithm
0 references
0.9867755770683287
0 references
0.8962245583534241
0 references
0.8895737528800964
0 references
0.8796672224998474
0 references
0.879651665687561
0 references
