scientific article; zbMATH DE number 1522943
From MaRDI portal
Publication:4511239
zbMATH Open0973.90086MaRDI QIDQ4511239FDOQ4511239
Authors: Berthold Vöcking, Santosh S. Vempala 
Publication date: 30 October 2000
Title of this publication is not available (Why is that?)
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 (19)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms
- On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
- Congestion in large balanced multirate networks
- Multicast Routing and Design of Sparse Connectors
- Congestion minimization for multipath routing via multiroute flows
- Algorithms and Computation
- Nash equilibria in all-optical networks
- Concurrent multicast in weighted networks
- Title not available (Why is that?)
- Experimental and Efficient Algorithms
- Hardness and approximation results for packing Steiner trees
- Bin Packing with Queues
- On routing in VLSI design and communication networks
- Packing trees in communication networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511239)
