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

DOI10.1007/S10878-012-9454-2zbMATH Open1282.90090OpenAlexW2031024903MaRDI QIDQ386436FDOQ386436

Authors: Yuichi Asahiro, Kenta Kanmera, Eiji Miyano 

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

Recommendations

• \((1 + \epsilon )\)-competitive algorithm for online OVSF code assignment with resource augmentation
• A constant-competitive algorithm for online OVSF code assignment
• Online OVSF Code Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Improving the competitive ratio of the online OVSF code assignment problem

zbMATH Keywords

resource augmentationcompetitive algorithmonline OVSF code assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

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

Cited In (7)

• Online tree node assignment with resource augmentation
• Improving the competitive ratio of the online OVSF code assignment problem
• Online Bandwidth Allocation
• Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• \((1 + \epsilon )\)-competitive algorithm for online OVSF code assignment with resource augmentation
• Online Tree Node Assignment with Resource Augmentation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386436)