On routing in VLSI design and communication networks

Discrete Applied Mathematics

Volumn 156, Issue 11, 2008, Pages 2178-2194

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

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF GUELPH   (Canada)

^c Canadian Imperial Bank of Commerce   (Canada)

Author keywords

Approximation algorithm; Communication networks; Routing; VLSI design

Indexed keywords

APPROXIMATION THEORY; COMMUNICATION; COMPUTER NETWORKS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; INTEGER PROGRAMMING; INTEGRATED CIRCUIT LAYOUT; LINEAR PROGRAMMING; LINEARIZATION; MULTICASTING; NETWORK ROUTING; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; SET THEORY; TELECOMMUNICATION NETWORKS; TRAFFIC CONGESTION; TREES (MATHEMATICS);

(ALGORITHMIC) COMPLEXITY; APPROXIMATION BOUNDS; APPROXIMATION RATIOS; ASYMPTOTIC APPROXIMATIONS; CAPACITY CONSTRAINTS; COMMUNICATION NETWORKS; EDGE LENGTH; ELSEVIER (CO); GENERAL (CO); GLOBAL ROUTING; INTEGER LINEAR PROGRAMMING (ILP); LATTICE (CO); LATTICE GRAPHS; LINEAR COMBINATION (LC); MIN MAX; MULTICAST CONGESTION; MULTICAST ROUTING; PACKING PROBLEMS; PROPERTY (S); REALISTIC MODELING; RESOURCE-SHARING; STEINER TREE PROBLEM (STP); TOTAL COSTS; VERTEX SETS; VLSI DESIGNS; WIRE LENGTHS;

APPROXIMATION ALGORITHMS;

EID: 47549100672     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.01.014     Document Type: Article

References (45)

1. Anstreicher K.M. Towards a practical volumetric cutting plane method for convex programming. SIAM J. Optim. 9 (1999) 190-206
2. Baltz A., and Srivastav A. Fast approximation of minimum multicast congestion-implementation versus theory. RAIRO Oper. Res. 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. Behjat L., Vannelli A., and Rosehart W. Linear programming models for the global routing problem. INFORMS J. Comput. 18 2 (2006) 137-150
5. Cai M., Deng X., and Wang L. Minimum k arborescences with bandwidth constraints. Algorithmica 38 (2004) 529-537
6. R. Carr, S. Vempala, Randomized meta-rounding, in: Proceedings of the 32nd ACM Symposium on the Theory of Computing, STOC, 2000, pp. 58-62.
7. M. Charikar, C. Chekuri, A. Goel, S. Guha, S. Plotkin, Approximating a finite metric by a small number of tree metrics, in: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS, 1998, pp. 379-388.
8. Chen S., Günlük O., and Yener B. The multicast packing problem. IEEE/ACM Trans. Networking 8 3 (2000) 311-318
9. J. Cheriyan, M. Salavatipour, Hardness and approximation results for packing Steiner trees problems, in: Proceedings of the 12th Annual European Symposium on Algorithms, ESA, 2004, Lecture Notes in Computer Science, vol. 3221, Springer, Berlin, 2004, pp. 180-191.
10. M. Chlebík, J. Chlebíková, Approximation hardness of the Steiner tree problem, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT, 2002, Lecture Notes in Computer Science, vol. 2368, 2002, pp. 170-179.
11. A. Deza, C. Dickson, T. Terlaky, A. Vanelli, H. Zhang, Global routing in VLSI design: algorithms, theory, and computational practice, Technical Report, AdvOL #2008-2, Advanced Optimization Lab., McMaster University, Hamilton, Ont., Canada 〈http://www.cas.mcmaster.ca/ ∼oplab/research.htm, 2008〉.
12. Grigoriadis M.D., and Khachiyan L.G. Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 2 (1996) 321-340
13. Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197
14. Grötschel M., Martin A., and Weismantel R. Packing Steiner trees: a cutting plane algorithm and computational results. Math. Programming 72 (1996) 125-145
15. Grötschel M., Martin A., and Weismantel R. Packing Steiner trees: separation algorithms. SIAM J. Discrete Math. 9 (1996) 233-257
16. Grötschel M., Martin A., and Weismantel R. The Steiner tree packing problem in VLSI-design. Math. Programming 78 (1997) 265-281
17. Hadlock F. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4 3 (1975) 221-225
18. K. Jain, M. Mahdian, M.R. Salavatipour, Packing Steiner trees, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 266-274.
19. K. Jansen, H. Zhang, Approximation algorithms for general packing problems and their application to the multicast congestion problem, Math. Programming, to appear, doi:10.1007/s10107-007-0106-8.
20. Jeong G.W., Lee K., Park S., and Park K. A branch-and-price algorithm for the Steiner tree packing problem. Comput. Oper. Res. 29 (2002) 221-241
21. Jia X., and Wang L. A group multicast routing algorithm by using multiple minimum Steiner trees. Comput. Comm. 20 (1997) 750-758
22. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, NY 85-103
23. E.S. Kuh, M. Marek-Sadowska, Global routing, vol. 1, Elsevier Science Publishers B.V., Amsterdam, 1985, pp. 133-168.
24. L.C. Lau, An approximate max-Steiner-tree-packing min-Steiner-cut theorem, in: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, FOCS, 2004, pp. 61-70.
25. L.C. Lau, Packing Steiner forests, in: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization, IPCO, 2005, Lecture Notes in Computer Science, vol. 3509, pp. 362-376.
26. Lee C.Y. An algorithm for path connection and its application. IRE Trans. on Electron. Comput. 10 (1961) 346-365
27. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout (1990), Wiley, New York
28. Lengauer T., and Lungering M. Provably good global routing of integrated circuits. SIAM J. Optim. 11 1 (2000) 1-30
29. Q. Lu, H. Zhang, Implementation of approximation algorithms for the multicast congestion problem, in: Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms, WEA, 2005, Lecture Notes in Computer Science, vol. 3503, pp. 152-164.
30. Ma B., and Wang L. On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints. J. Comput. System Sci. 60 (2000) 1-12
31. Martin A., and Weismantel R. Packing paths and Steiner trees: routing of electronic circuits. CWI Quart. 6 (1993) 185-204
32. Plotkin S.A., Shmoys D.B., and Tardos E. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 2 (1995) 257-301
33. W.R. Pulleyblank, Two Steiner tree packing problems, in: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, STOC, 1995, pp. 383-387.
34. Raghavan P. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37 (1988) 130-143
35. Raghavan P., and Thompson C.D. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 4 (1987) 365-374
36. G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2000, pp. 770-779.
37. M. Saad, T. Terlaky, A. Vannelli, 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, Ont., Canada. 〈http://www.cas.mcmaster.ca/∼oplab/research.htm〉, 2005.
38. M. Saad, T. Terlaky, A. Vannelli, H. Zhang, Packing Trees in Communication Networks, in: Proceedings of the 1st Workshop on Internet and Network Economics, WINE, 2005, Lecture Notes in Computer Science, vol. 3828, pp. 688-697.
39. Sherwani N. Algorithms for VLSI Physical Design Automation (1999), Kluwer Academic Publishers, Dordrecht
40. Shragowitz E., and Keel S. A global router on a multi-commodity flow model. Interaction 5 (1987) 3-16
41. Vannelli A. An adaptation of the interior point method for solving the global routing problem. IEEE Trans. Comput. Aided Design 10 2 (1991) 193-203
42. S. Vempala, B. Vöcking, Approximating multicast congestion, in: Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC, 1999, Lecture Notes in Computer Science, vol. 1741, pp. 367-372.
43. J. Villavicencio, M.D. Grigoriadis, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, in: P. Pardalos, D.W. Hearn, W.W. Hager (Eds.), Network Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 450, Springer, Berlin, 1997, pp. 471-485.
44. Wang C.-F., Liang C.-T., and Jan R.-H. Heuristic algorithms for packing multiple-group multicasting. Comput. Oper. Res. 29 (2002) 905-924
45. H. Zhang, Approximation algorithms for min-max resource sharing and malleable tasks scheduling, Ph.D. Thesis, University of Kiel, 2004.