Online OVSF Code Assignment with Resource Augmentation
From MaRDI portal
Publication:5434437
DOI10.1007/978-3-540-72870-2_18zbMath1137.90375OpenAlexW1604224724MaRDI QIDQ5434437
Hong Zhu, Yong Zhang, Francis Y. L. Chin
Publication date: 4 January 2008
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72870-2_18
Related Items (8)
A constant-competitive algorithm for online OVSF code assignment ⋮ Improving the competitive ratio of the online OVSF code assignment problem ⋮ Online Tree Node Assignment with Resource Augmentation ⋮ (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation ⋮ Constant-competitive tree node assignment ⋮ Online tree node assignment with resource augmentation ⋮ A Constant-Competitive Algorithm for Online OVSF Code Assignment ⋮ Absolute and asymptotic bounds for online frequency allocation in cellular networks
This page was built for publication: Online OVSF Code Assignment with Resource Augmentation
