An algorithmic view on OVSF code assignment
From MaRDI portal
Publication:878438
DOI10.1007/s00453-006-0188-3zbMath1112.68137OpenAlexW2161146565MaRDI QIDQ878438
Matúš Mihalák, Riko Jacob, Gábor Szabó, Marc Nunkesser, Peter Widmayer, Erlebach, Thomas
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25)
Related Items
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, Constant-competitive tree node assignment, Online tree node assignment with resource augmentation, Absolute and asymptotic bounds for online frequency allocation in cellular networks
