Online Tree Node Assignment with Resource Augmentation

DOI10.1007/978-3-642-02882-3_36zbMath1248.68570OpenAlexW1980218473MaRDI QIDQ5323084

Joseph Wun-Tat Chan, Yong Zhang, Hing-Fung Ting, Francis Y. L. Chin

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_36

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (2)

Improving the competitive ratio of the online OVSF code assignment problem ⋮ (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

Cites Work

• Constant-competitive tree node assignment
• An algorithmic view on OVSF code assignment
• Fast allocation and deallocation with an improved buddy system
• OVSF-CDMA code assignment in wireless ad hoc networks
• Online Bandwidth Allocation
• Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
• Speed is as powerful as clairvoyance
• A fast storage allocator
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Online OVSF Code Assignment with Resource Augmentation
• Computing and Combinatorics

This page was built for publication: Online Tree Node Assignment with Resource Augmentation