A constant-competitive algorithm for online OVSF code assignment

DOI10.1007/s00453-008-9241-8zbMath1187.68717OpenAlexW2129646118MaRDI 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

zbMATH Keywords

competitive analysisonline algorithmslower boundswideband code-division multiple-access

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Online algorithms; streaming algorithms (68W27)

Related Items (2)

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

Uses Software

• CDMA/OVSF

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

This page was built for publication: A constant-competitive algorithm for online OVSF code assignment