On-line competitive algorithms for call admission in optical networks
From MaRDI portal
Publication:4595505
DOI10.1007/3-540-61680-2_73zbMath1379.68358OpenAlexW2156707433MaRDI QIDQ4595505
Baxuch Awerbuch, Adi Rosén, Stefano Leonardi, Amos Fiat, Yossi Azar
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_73
Communication networks in operations research (90B18) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (7)
The online knapsack problem with incremental capacity ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ A Preemptive Algorithm for Maximizing Disjoint Paths on Trees ⋮ On-line routing in all-optical networks ⋮ A preemptive algorithm for maximizing disjoint paths on trees ⋮ On-line routing in all-optical networks ⋮ Approximation algorithms for routing and call scheduling in all-optical chains and rings.
This page was built for publication: On-line competitive algorithms for call admission in optical networks
