Online tree node assignment with resource augmentation
From MaRDI portal
Publication:652619
DOI10.1007/s10878-010-9292-zzbMath1229.90152MaRDI 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
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
68W27: Online algorithms; streaming algorithms
Related Items
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