Fast approximation of minimum multicast congestion - Implementation versus theory

RAIRO - Operations Research

Volumn 38, Issue 4, 2004, Pages 319-344

  Baltz, Andreas ^a   Srivastav, Anand ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation algorithms; Combinatorial optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MULTICASTING; OPTIMIZATION; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; MULTICAST COMMUNICATION NETWORKS; UNDIRECTED GRAPH;

CONGESTION CONTROL (COMMUNICATION);

EID: 12344269246     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2004028     Document Type: Article

References (18)

1. J. Aspnes, Y. Azar, A.Fiat, S. Plotkin and O. Waarts, On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. Association Computing Machinery 44 (1997) 486-504.
2. R. Carr and S. Vempala, Randomized Metarounding, in Proc. of the 32nd ACM Symposium on the theory of computing (STOC '00), Portland, USA (2000) 58-62.
3. N. Garg, J. Könemann, Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems, in Proc. 39th IEEE Annual Symposium on Foundations of Computer Science (1998) 300-309.
4. A.V. Goldberg, A natural randomization strategy for multicommodity flow and related algorithms. Inform. Process. Lett. 42 (1992) 249-256.
5. A.V. Goldberg, A.D. Oldham, S. Plotkin and C. Stein, An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flows, in Proc. 6th Conf. on Integer Prog. and Combinatorial Optimization (1998) 338-352.
6. M.D. Grigoriadis and L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4 (1994) 86-107.
7. K. Jansen and H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, in Proc. 3rd Int. Worksh. on Approx. and Random. Alg. in Commun. Netw. (ARANCE'02), Roma, Italy, September 21. Carleton Scientific (2002) 77-90.
8. K. Jansen and H. Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, in Proc. 2nd IFIP Int. Conf. on Theoretical Computer Science (TCS'02), Montréal, Québec, Canada, August 25-30 (2002).
9. P. Klein, S. Plotkin, C. Stein and E. Tardos, Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM J. Comput. 23 (1994) 466-487.
10. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems. J. Comp. Syst. Sci. 50 (1995) 228-243.
11. D.W. Matula and F. Shahrokhi, The maximum concurrent flow problem. J. Association Computing Machinery 37 (1990) 318-334.
12. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs. Inform. Process. Lett. 27 (1998) 125-128.
13. S. Plotkin, D. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20 (1995) 257-301.
14. T. Radzik, Fast deterministic approximation for the multicommodity flow problem. Math. Prog. 78 (1997) 43-58.
15. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs. J. Comp. Syst. Sci. 38 (1994) 683-707.
16. A. Srivastav and P. Stangier, On complexity, representation and approximation of integral multicommodity flows. Discrete Appl. Math. 99 (2000) 183-208.
17. S. Vempala and B. Vöcking, Approximating Multicast Congestion, in Proc. 10th ISAAC, Chennai, India (1999) 367-372.
18. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, in Proc. of the 11th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2000) (2000) 770-779.