Implementation of approximation algorithms for the multicast congestion problem

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 152-164

  Lu, Qiang ^a   Zhang, Hu ^b  

^a ZHEJIANG UNIVERSITY   (China)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); HEURISTIC METHODS; MULTICASTING; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; HEURISTICS; MULTICAST CONGESTION; STEINER TREE SOLVER;

ALGORITHMS;

EID: 24944544706     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_15     Document Type: Conference Paper

References (24)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, Journal of the ACM, 45 (1998), 501-555.
2. 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, Journal of the Association for Computing Machinery, 44(3) (1997), 486-504.
3. A. Baltz and A. Srivastav, Fast approximation of multicast congestion, manuscript (2001).
4. A. Baltz and A. Srivastav, Fast approximation of minimum multicast congestion - implementation versus theory, Proceedings of the 5th Conference on Algorithms and Complexity, CIAC 2003.
5. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Information Professing Letters, 32 (1989), 171-176.
6. R. Carr and S. Vempala, Randomized meta-rounding, Proceedings of the 32nd ACM Symposium on the Theory of Computing, STOC 2000, 58-62.
7. S. Chen, O. Günlük and B. Yener, The multicast packing problem, IEEE/ACM Transactions on Networking, 8 (3) (2000), 311-318.
8. M. Chlebík and J. Chlebíková, Approximation hardness of the Steiner tree problem, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, LNCS 2368, 170-179.
9. R. Floren, A note on "A faster approximation algorithm for the Steiner problem in graphs", Information Processing Letters, 38 (1991), 177-178.
10. N. Garg and J. Könemann, Fast and simpler algorithms for multicommodity flow and other fractional packing problems, Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS 1998, 300-309.
11. M. D. Grigoriadis and L. G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM Journal on Optimization, 4 (1994), 86-107.
12. M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel pricedirective decomposition, Mathematics of Operations Research, 2 (1996), 321-340.
13. K. Jansen and H. Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, 255-266.
14. K. Jansen and H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, Proceedings of the 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks, ARACNE 2002, 77-90.
15. R. M. Karp, Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, NY, (1972), 85-103.
16. 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 Journal on Computing, 23 (1994), 466-487.
17. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters, 27 (1988), 125-128.
18. C. A. S. Oliveira and P. M. Pardolos, A survey of combinatorial optimization problems in multicast routing, Computers and Operations Research, 32 (2005), 1953-1981.
19. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, Journal of Computer and System Science, 37 (1988), 130-143.
20. P. Raghavan and C. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), 365-374.
21. G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, 770-779.
22. S. Vempala and B. Vöcking, Approximating multicast congestion, Proceedings of the tenth International Symposium on Algorithms and Computation, ISAAC 1999, LNCS 1741, 367-372.
23. J. Villavicencio and M. D. Grigoriadis, Approximate structured optimization by cyclic block-coordinate descent, Applied Mathematics and Parallel Computing, H. Fisher et al. (Eds), Physica Verlag, (1996), 359-371.
24. J. Villavicencio and M. D. Grigoriadis, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, Network Optimization, P. Pardalos, D. W. Hearn and W. W. Hager (Eds.), Lecture Notes in Economics and Mathematical Systems 450, Spring er-Verlag, Berlin, (1997), 471-485.