A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
The maximum concurrent flow problem
Journal of the ACM (JACM)
A natural randomization strategy for multicommodity flow and related algorithms
Information Processing Letters
Fast approximation algorithms for multicommodity flow problems
Selected papers of the 23rd annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Fast deterministic approximation for the multicommodity flow problem
Mathematical Programming: Series A and B
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On complexity, representation and approximation of integral multicommodity flows
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard standard routing problem. We present the presently best theoretical approximation results as well as efficient implementations.