Improving the competitive ratio of the online OVSF code assignment problem
From MaRDI portal
(Redirected from Publication:1662487)
Recommendations
- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
- A constant-competitive algorithm for online OVSF code assignment
- A Constant-Competitive Algorithm for Online OVSF Code Assignment
- \((1 + \epsilon )\)-competitive algorithm for online OVSF code assignment with resource augmentation
- (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation
Cites work
- A Constant-Competitive Algorithm for Online OVSF Code Assignment
- An algorithmic view on OVSF code assignment
- Constant-competitive tree node assignment
- Online Bandwidth Allocation
- Online OVSF Code Assignment with Resource Augmentation
- Online Tree Node Assignment with Resource Augmentation
- Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks
Cited in
(4)- A Constant-Competitive Algorithm for Online OVSF Code Assignment
- \((1 + \epsilon )\)-competitive algorithm for online OVSF code assignment with resource augmentation
- Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
- (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation
This page was built for publication: Improving the competitive ratio of the online OVSF code assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662487)