On routing in VLSI design and communication networks

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

Volumn 3827 LNCS, Issue , 2005, Pages 1051-1060

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

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

APPROXIMATION ALGORITHMS; LATTICE GRAPHS; ROUTING PROBLEM; STEINER TREE PROBLEM;

VLSI CIRCUITS;

EID: 33744949218     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_104     Document Type: Conference Paper

References (22)

1. K. M. Anstreicher, Towards a practical volumetric cutting plane method for convex programming, SIAM Journal on Optimization, 9 (1999), 190-206.
2. A. Baltz and A. Srivastav, Fast approximation of minimum multicast congestion - implementation versus theory, RAIRO Operations Research, 38 (2004), 319-344.
3. L. Behjat, New modeling and optimization techniques for the global routing problem, Ph.D. Thesis, University of Waterloo, 2002.
4. L. Behjat, A. Vannelli, W. Rosehart, Linear programming models for the global routing problem, to appear in Informs Journal on Computing, 2004.
5. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Information Professing Letters, 32 (1989), 171-176.
6. M. Cai, X. Deng and L. Wang, Minimum k arborescences with bandwidth constraints, Algorithmica, 38 (2004), 529-537.
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. D. Grigoriadis and L. G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Mathematics of Operations Research, 2 (1996), 321-340.
9. F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM Journal on Computing, 4(3) (1975), 221-225.
10. K. Jansen and H. Zhang, Approximation algorithms for general packing problems with modified logarithmic potential function, Proceedings of TCS 2002, 255-266.
11. K. Jansen and H. Zhang, An approximation algorithm for the multicast congestion problem via minimum Steiner trees, Proceedings of ARACNE 2002, 77-90.
12. X. Jia and L. Wang, A group multicast routing algorithm by using multiple minimum Steiner trees, Computer Communications, 20 (1997), 750-758.
13. C. Y. Lee, An algorithm for path connection and its application, IRE Transactions on Electronic Computers, 10 (1961), 346-365.
14. T. Lengauer, Combinatorial algorithms for integrated circuit layout, J. Wiley, New York, 1990.
15. T. Lengauer and M. Lungering, Provably good global routing of integrated circuits, SIAM Journal on Optimization, 11(1) (2000), 1-30.
16. P. Raghavan, Probabilistic construction of deterministic algorithms: approximating packing integer programs, Journal of Computer and System Sciences, 37 (1988), 130-143.
17. P. Raghavan and C. D. Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatoria, 7(4) (1987), 365-374.
18. M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, Packing trees in communication networks, to appear in Proceedings of WINE 2005, LNCS.
19. T. Terlaky, A. Vannelli and H. Zhang, On routing in VLSI design and communication networks, Technical Report, AdvOL #2005-14, Advanced Optimization Lab., McMaster University, http://www.cas.mcmaster.ca/~oplab/research.htm.
20. A. Vannelli, An adaptation of the interior point method for solving the global routing problem, IEEE Transactions on Computer-Aided Design, 10(2) (1991), 193-203.
21. 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.
22. H. Zhang, Approximation algorithms for min-max resource sharing and malleable tasks scheduling, Ph.D. Thesis, University of Kiel, 2004.