Improving the Competitive Ratio of the Online OVSF Code Assignment Problem

DOI10.1007/978-3-540-92182-0_9MaRDI QIDQ3596707zbMATH OpenOpenAlexFDO

Authors Shuichi Miyazaki, Kazuya Okamoto

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

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27)

Recommendations

• Improving the competitive ratio of the online OVSF code assignment problem
• A constant-competitive algorithm for online OVSF code assignment
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• (1 + )-competitive algorithm for online OVSF code assignment with resource augmentation
• (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation

Cited in

(6)

• Improving the competitive ratio of the online OVSF code assignment problem
• Constant-competitive tree node assignment
• Online Tree Node Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Online tree node assignment with resource augmentation
• A constant-competitive algorithm for online OVSF code assignment

This page was built for publication: Improving the Competitive Ratio of the Online OVSF Code Assignment Problem

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