(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

DOI10.1007/s10878-012-9454-2zbMath1282.90090OpenAlexW2031024903MaRDI QIDQ386436

Kenta Kanmera, Eiji Miyano, Yuichi Asahiro

Publication date: 9 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9454-2

zbMATH Keywords

resource augmentationcompetitive algorithmonline OVSF code assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• A constant-competitive algorithm for online OVSF code assignment
• Improving the competitive ratio of the online OVSF code assignment problem
• Online bin packing with resource augmentation
• Online Bandwidth Allocation
• Speed is as powerful as clairvoyance
• STACS 2004
• Online Tree Node Assignment with Resource Augmentation
• Online OVSF Code Assignment with Resource Augmentation
• Optimal time-critical scheduling via resource augmentation

This page was built for publication: (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation