Implementation of approximation algorithms for the multicast congestion problem
From MaRDI portal
Recommendations
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Fast approximation of minimum multicast congestion -- implementation versus theory
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Approximating multicast congestion
- Computing and Combinatorics
Cited in
(13)- Packing trees in communication networks
- An improved approximation algorithm for capacitated multicast routings in networks
- An approximation algorithm for the directed telephone multicast problem
- Fast approximation of minimum multicast congestion -- implementation versus theory
- Approximating multicast congestion
- Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Heuristic algorithms for packing of multiple-group multicasting
- A new congestion control algorithm for improving the performance of a broadcast-based multiprocessor architecture
- Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
- Faster and simpler approximation algorithms for mixed packing and covering problems
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- On routing in VLSI design and communication networks
This page was built for publication: Implementation of approximation algorithms for the multicast congestion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710014)
