A constant-competitive algorithm for online OVSF code assignment
From MaRDI portal
Publication:848939
DOI10.1007/s00453-008-9241-8zbMath1187.68717MaRDI QIDQ848939
Hing-Fung Ting, Yong Zhang, Francis Y. L. Chin
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9241-8
Related Items
(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation, Constant-competitive tree node assignment
Uses Software
Cites Work
- Efficient on-line frequency allocation and call control in cellular networks
- Greedy online frequency allocation in cellular networks
- An algorithmic view on OVSF code assignment
- OVSF-CDMA code assignment in wireless ad hoc networks
- Online Bandwidth Allocation
- Channel assignment and weighted coloring
- Online OVSF Code Assignment with Resource Augmentation
- Frequency Allocation Problems for Linear Cellular Networks
- Computing and Combinatorics