An approximation algorithm for the directed telephone multicast problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2038712
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- Sublogarithmic approximation for telephone multicast
- scientific article; zbMATH DE number 2079323
- Experimental and Efficient Algorithms
- Approximation algorithms and relaxations for a service provision problem on a telecommunication network
- Approximation algorithms for the k-source multicast tree construction problem
- Algorithms and Computation
- A new proximal decomposition algorithm for routing in telecommunication networks
- Complexity and approximations for multimessage multicasting
Cited in
(10)- scientific article; zbMATH DE number 5585902 (Why is no real title available?)
- Network-design with degree constraints
- On some network design problems with degree constraints
- Sublogarithmic approximation for telephone multicast
- scientific article; zbMATH DE number 2038712 (Why is no real title available?)
- scientific article; zbMATH DE number 2079323 (Why is no real title available?)
- On the complexity of the shortest-path broadcast problem
- Spider covers and their applications
- A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
- Sending secrets swiftly: approximation algorithms for generalized multicast problems
This page was built for publication: An approximation algorithm for the directed telephone multicast problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505499)