Online tree node assignment with resource augmentation

DOI10.1007/s10878-010-9292-zzbMath1229.90152OpenAlexW3022305442MaRDI QIDQ652619

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

Publication date: 15 December 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9292-z

zbMATH Keywords

online algorithmsresource augmentationtree node assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Constant-competitive tree node assignment

Cites Work

• 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