Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
From MaRDI portal
Publication:3596707
DOI10.1007/978-3-540-92182-0_9zbMath1183.68751OpenAlexW1745706155MaRDI QIDQ3596707
Kazuya Okamoto, Shuichi Miyazaki
Publication date: 29 January 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/226991
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Online Tree Node Assignment with Resource Augmentation ⋮ Constant-competitive tree node assignment ⋮ Online tree node assignment with resource augmentation
This page was built for publication: Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
