An approximation algorithm for the directed telephone multicast problem
From MaRDI portal
Publication:2505499
DOI10.1007/s00453-005-1196-4zbMath1099.68011OpenAlexW2008802014MaRDI QIDQ2505499
Publication date: 26 September 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1196-4
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
On some network design problems with degree constraints ⋮ Spider covers and their applications ⋮ On the complexity of the shortest-path broadcast problem ⋮ Network-Design with Degree Constraints
