Packing trees in communication networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3828 LNCS, Issue , 2005, Pages 688-697

  Saad, Mohamed ^a   Terlaky, Tamás ^b   Vannelli, Anthony ^c   Zhang, Hu ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MULTICASTING; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; SET THEORY;

APPROXIMATION ALGORITHMS; PACKING TREES; STEINER TREES; SUBSETS OF VERTICES;

TELECOMMUNICATION NETWORKS;

EID: 33744923676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_69     Document Type: Conference Paper

References (25)

1. K. M. Anstreicher, Towards a practical volumetric cutting plane method for convex programming, SIAM J. Optimization, 9 (1999), 190-206.
2. A. Baltz and A. Srivastav, Fast approximation of minimum multicast congestion - implementation versus theory, RAIRO Oper. Res., 38 (2004), 319-344.
3. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Inf. Process. Lett., 32 (1989), 171-176.
4. M. Gai, X. Deng and L. Wang, Minimum k arborescences with bandwidth constraints, Algorithmica, 38 (2004), 529-537.
5. R. Carr and S. Vempala, Randomized meta-rounding, Proceedings of STOC 2000, 58-62.
6. S. Chen, O. Günlük and B. Yener, The multicast packing problem, IEEE/ACM Trans. Networking, 8 (3) (2000), 311-318.
7. N. Garg and J. Könemann, Fast and simpler algorithms for multicommodity flow and other fractional packing problems, Proceedings of FOCS 1998, 300-309.
8. M. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Math. Oper. Res., 2 (1996), 321-340.
9. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorial, 1 (1981), 169-197.
10. K. Jain, M. Mahdian and M.R. Salavatipour, Packing Steiner trees, Proceedings of SODA 2003, 266-274.
11. K. Jansen and H. Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, Proceedings of TCS 2002, 255-266.
12. K. Jansen and H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, Proceedings of ARACNE 2002, 77-90.
13. X. Jia and L. Wang, A group multicast routing algorithm by using multiple minimum Steiner trees, Comput. Commun. 20 (1997), 750-758.
14. L. C. Lau, An approximate max-Steiner-tree-packing min-Steiner-cut theorem, Proceedings of STOC 2004, 61-70.
15. L. C. Lau, Packing Steiner forests, Proceedings of IPCO 2005, 362-376.
16. Q. Lu and H. Zhang, Implementation of approximation algorithms for the multicast congestion problem, Proceedings of WEA 2005, LNCS 3503, 152-164.
17. S. A. Plotkin, D. B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res., 2 (1995), 257-301.
18. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, J. Comput. Syst. Sci., 37 (1988), 130-143.
19. P. Raghavan and C. D. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica 7 (4) (1987), 365-374.
20. M. Saad, T. Terlaky, A. Vannelli and H. Zhang, A provably good global routing algorithm in multilayer IC and MCM layout designs, Technical Report, AdvOL #2005-15, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada. http://www.cas.mcmaster.ca/oplab/research.htm.
21. M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, Packing Trees in Communication Networks, Technical Report, AdvOL #2005-14, Advanced Optimization Lab., McMaster University, Hamilton, ON, Canada. http://www.cas.mcmaster.ca/oplab/research.htm.
22. T. Terlaky, A. Vannelli and H. Zhang, On routing in VLSI design and communication networks, to appear in Proceedings of ISAAC 2005, LNCS.
23. S. Vempala and B. Vöcking, Approximating multicast congestion, Proceedings of ISAAC 1999, LNCS 1741, 367-372.
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, Springer-Verlag, Berlin, (1997), 471-485.
25. N. E. Young, Randomized rounding without solving the linear program, Proceedings of SODA 1995, 170-178.