An algorithmic view on OVSF code assignment

DOI10.1007/S00453-006-0188-3zbMATH Open1112.68137OpenAlexW2161146565MaRDI QIDQ878438FDOQ878438

Authors Riko Jacob, Matúš Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer, Thomas Erlebach 

Publication date 26 April 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://doc.rero.ch/record/312490/files/453_2006_Article_188.pdf

zbMATH Keywords

polynomial-time greedy algorithm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

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

Cited In (13)

• Constant-competitive tree node assignment
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• A constant-competitive algorithm for online OVSF code assignment
• Online tree node assignment with resource augmentation
• Improving the competitive ratio of the online OVSF code assignment problem
• OVSF-CDMA code assignment in wireless ad hoc networks
• Computing and Combinatorics
• On Walsh code assignment
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• OVSF code assignment strategies with minimal fragmentations for WCDMA systems
• STACS 2004
• Online Tree Node Assignment with Resource Augmentation
• Online OVSF Code Assignment with Resource Augmentation

This page was built for publication: An algorithmic view on OVSF code assignment

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