Approximating multicast congestion
From MaRDI portal
Recommendations
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- scientific article; zbMATH DE number 2011854
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Experimental and Efficient Algorithms
- Congestion minimization for multipath routing via multiroute flows
Cited in
(20)- On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
- Packing trees in communication networks
- Nash equilibria in all-optical networks
- Hardness and approximation results for packing Steiner trees
- Congestion in large balanced multirate networks
- scientific article; zbMATH DE number 2088550 (Why is no real title available?)
- scientific article; zbMATH DE number 5454665 (Why is no real title available?)
- Multicast Routing and Design of Sparse Connectors
- scientific article; zbMATH DE number 1949576 (Why is no real title available?)
- scientific article; zbMATH DE number 2011854 (Why is no real title available?)
- Concurrent multicast in weighted networks
- Congestion minimization for multipath routing via multiroute flows
- Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms
- Bin Packing with Queues
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Experimental and Efficient Algorithms
- Algorithms and Computation
- Near-optimal schedules for simultaneous multicasts
- 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: Approximating multicast congestion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511239)
