Online Tree Node Assignment with Resource Augmentation

DOI10.1007/978-3-642-02882-3_36MaRDI QIDQ5323084zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Online tree node assignment with resource augmentation
• Constant-competitive tree node assignment
• (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation
• (1 + )-competitive algorithm for online OVSF code assignment with resource augmentation
• Online OVSF Code Assignment with Resource Augmentation

Cites work

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

Cited in

(5)

• Improving the competitive ratio of the online OVSF code assignment problem
• Online Bandwidth Allocation
• (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation
• Constant-competitive tree node assignment
• Online tree node assignment with resource augmentation

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

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