Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
From MaRDI portal
Publication:852254
DOI10.1007/s10559-006-0026-2zbMath1102.68733OpenAlexW1984192656MaRDI QIDQ852254
Carlos A. S. Oliveira, Panos M. Pardalos
Publication date: 28 November 2006
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-006-0026-2
Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Network protocols (68M12)
Related Items (3)
Mathematical programming approaches for dual multicast routing problem with multilayer risk cost ⋮ A branch-and-cut algorithm for the Steiner tree problem with delays ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
Cites Work
This page was built for publication: Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
