Online Bandwidth Allocation
From MaRDI portal
Publication:3527246
DOI10.1007/978-3-540-75520-3_49zbMath1151.90344OpenAlexW1803236231MaRDI QIDQ3527246
Michal Forišek, Vladimír Koutný, Richard Královič, Tomas Plachetka, Dana Pardubská, Jana Katreniaková, Rastislav Královič, Branislav Katreniak, Branislav Rovan
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_49
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Communication networks in operations research (90B18)
Related Items (6)
A constant-competitive algorithm for online OVSF code assignment ⋮ Improving the competitive ratio of the online OVSF code assignment problem ⋮ Online Tree Node Assignment with Resource Augmentation ⋮ (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation ⋮ Online tree node assignment with resource augmentation ⋮ A Constant-Competitive Algorithm for Online OVSF Code Assignment
This page was built for publication: Online Bandwidth Allocation
