Constant-competitive tree node assignment

DOI10.1016/j.tcs.2013.05.014zbMath1358.68327OpenAlexW2156051565MaRDI QIDQ391778

Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.014

zbMATH Keywords

online algorithmscompetitive ratiotree node assignment

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (2)

Improving the competitive ratio of the online OVSF code assignment problem ⋮ Online Tree Node Assignment with Resource Augmentation

Cites Work

• Unnamed Item
• Online tree node assignment with resource augmentation
• Greedy online frequency allocation in cellular networks
• A constant-competitive algorithm for online OVSF code assignment
• An algorithmic view on OVSF code assignment
• Fast allocation and deallocation with an improved buddy system
• Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
• A fast storage allocator
• Subcube allocation in hypercube computers
• Online OVSF Code Assignment with Resource Augmentation
• Computing and Combinatorics

This page was built for publication: Constant-competitive tree node assignment