A Constant-Competitive Algorithm for Online OVSF Code Assignment
From MaRDI portal
Publication:5387778
DOI10.1007/978-3-540-77120-3_40zbMath1193.68047OpenAlexW4235877784MaRDI QIDQ5387778
Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting
Publication date: 27 May 2008
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_40
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
Related Items
Improving the competitive ratio of the online OVSF code assignment problem, Online Tree Node Assignment with Resource Augmentation, Online tree node assignment with resource augmentation, Absolute and asymptotic bounds for online frequency allocation in cellular networks
Cites Work
- Unnamed Item
- Efficient on-line frequency allocation and call control in cellular networks
- Greedy online frequency allocation in cellular networks
- OVSF-CDMA code assignment in wireless ad hoc networks
- Online Bandwidth Allocation
- Channel assignment and weighted coloring
- STACS 2004
- Online OVSF Code Assignment with Resource Augmentation
- Frequency Allocation Problems for Linear Cellular Networks
- Computing and Combinatorics