(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation (Q386436): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-012-9454-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031024903 / rank | |||
Normal rank | |||
Revision as of 21:22, 19 March 2024
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
