(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B80 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6236744 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
online OVSF code assignment problem | |||
| Property / zbMATH Keywords: online OVSF code assignment problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
resource augmentation | |||
| Property / zbMATH Keywords: resource augmentation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
competitive algorithm | |||
| Property / zbMATH Keywords: competitive algorithm / rank | |||
Normal rank | |||
Revision as of 12:59, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation |
scientific article |
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
