Provably good global routing of integrated circuits

SIAM Journal on Optimization

Volumn 11, Issue 1, 2000, Pages 1-30

  Lengauer, T ^a,b   Lugering M ^b  

^a FRAUNHOFER INSTITUTE FOR APPLIED INFORMATION TECHNOLOGY FIT   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Combinatorial optimization; Integer programming; Integrated circuits; Routing

Indexed keywords

EID: 0034552291     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497331786     Document Type: Article

References (40)

1. M. BURSTEIN AND S. J. HONG, Hierarchical VLSI layout: Simultaneous wiring and placement, in Proceedings of VLSI '83, F. Anceau and E. J. Aas, eds., Elsevier Science Publishers B.V., Amsterdam, 1983, pp. 45-60.
2. M. BURSTEIN AND R. PELAVIN, Hierarchical wire routing, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2 (1983), pp. 223-234.
3. R. C. CARDEN AND C.-K. CHENG, A global router using an efficient approximate multicommodity multiterminal flow algorithm, in Proceedings of the 28th Design Automation Conference, San Francisco, ACM/IEEE, 1991, pp. 316-321.
4. R. C. GARDEN, J. LI, AND C.-K. CHENG, A global router with a theoretical bound on the optimal solution, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 15 (1996), pp. 208-216.
5. C. CHIANG, M. SARRAFZADEH, AND C. K. WONG, A powerful global router: Based on Steiner min-max trees, in Proceedings of the International Conference on Computer-Aided Design, Sanata Clara, CA, IEEE, 1989, pp. 2-5.
6. C. CHIANG, M. SARRAFZADEH, AND C. K. WONG, Global routing based on Steiner min-max trees, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 9 (1990), pp. 1318-1325.
7. C. CHIANG, C. K. WONG, AND M. SARRAFZADEH, A weighted Steiner tree-based global router with simultaneous length and density minimization, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 13 (1994), pp. 1461-1469.
8. W. W.-M. DAI AND E. S. KUH, Simultaneous floorplanning and global routing for hierarchical building block layout, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 6 (1987), pp. 828-837.
9. H. ESBENSEN, A macro-cell global router based on two genetic algorithms, in Proceedings of the European Design Automation Conference, Grenoble, 1994, pp. 428-433.
10. H. ESBENSEN AND P. MAZUMDER, A genetic algorithm for the Steiner problem in a graph, in Proceedings of the European Design and Test Conference, Paris, 1994, pp. 402-406.
11. M. GRÖTSCHEL, A. MARTIN, AND R. WEISMANTEL, Packing Steiner trees: A cutting plane algorithm and computational results, Math. Programming, 72 (1996), pp. 125-145.
12. M. GRÖTSCHEL, A. MARTIN, AND R. WEISMANTEL, Packing Steiner trees: Further facets. European J. Combin., 17 (1996), pp. 39-52.
13. M. GRÖTSCHEL, A. MARTIN, AND R. WEISMANTEL, Packing Steiner trees: Polyhedral investigations, Math. Programming, 72 (1996), pp. 101-123.
14. M. GRÖTSCHEL, A. MARTIN, AND R. WEISMANTEL, Packing Steiner trees: Separation algorithms, SIAM J. Discrete Math., 9 (1996), pp. 233-257.
15. M. GRÖTSCHEL, A. MARTIN, AND R. WEISMANTEL, The Steiner tree packing problem in VLSI-design, Math. Programming, 78 (1997), pp. 265-281.
16. J. HEISTERMANN AND T. LENGAUER, The efficient solution of integer programs for hierarchical global routing, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 10 (1991), pp. 748-753.
17. J. H. HOLLAND, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
18. T. C. HU, Integer Programming and Network Flows, Addison-Wesley, Reading, MA, 1969.
19. T. C. HU AND M. T. SHING, A decomposition algorithm for circuit routing, in VLSI Circuit Layout: Theory and Design, T. C. Hu and E. S. Kuh, eds., IEEE, New York, 1985, pp. 144-152.
20. N. KARMARKAR, A new polynomial algorithm for linear programming, Combinatorica, 4 (1984), pp. 373-395.
21. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-103.
22. R. M. KARP, F. T. LEIGHTON, R. L. RIVEST, C. D. THOMPSON, U. V. VAZIRANI, AND V. V. VAZIRANI, Global wire routing in two-dimensional arrays, Algorithmica, 2 (1987), pp. 113-129.
23. L. G. KHACHIAN, A polynomial algorithm for linear programming, Doklady Akad. Nauk. USSR, 244 (1979), pp. 1093-1096 (in Russian); Soviet Math. Doklady, 20 (1979), pp. 191-194 (in English).
24. L. G. KHACHIAN, A polynomial algorithm for linear programming, Doklady Akad. Nauk. USSR, 244 (1979), pp. 1093-1096 (in Russian); Soviet Math. Doklady, 20 (1979), pp. 191-194 (in English).
25. B. KORTE, H. J. PRÖMEL, AND A. STEGER, Steiner trees in VLSI-layout, in Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, eds., Springer-Verlag, Berlin, Heidelberg, New York, 1990, pp. 185-214.
26. M. R. KRAMER AND J. VAN LEEUWEN, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits, in Advances in Computing Research, Vol. 2: VLSI Theory, F. P. Preparata, ed., JAI Press, Reading, MA, 1984, pp. 129-146.
27. T. LENGAUER, Combinatorial Algorithms for Integrated Circuit Layout, Teubner-Wiley Series of Applicable Theory in Computer Science, John Wiley & Sons, New York, 1990.
28. T. LENGAUER AND M. LÜGERING, Integer program formulations of global routing and placement problems, in Algorithmic Aspects of VLSI Layout, M. Sarrafzadeh and D. T. Lee, eds., Lecture Notes Series on Computing 2, World Scientific, Singapore, 1993, pp. 167-197.
29. T. LENGAUER AND R. MÜLLER, Robust and accurate hierarchical floorplanmng with integrated global wiring, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 12 (1993), pp. 802-809.
30. W. K. LUK, P. SIPALA, M. TAMMINEN, D. TANG, L. S. WOO, AND C. K. WONG, A hierarchical global wiring algorithm for custom chip design, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 6 (1987), pp. 518-533.
31. A. P.-C. NG, P. RAGHAVAN, AND C. D. THOMPSON, Experimental results for a linear program global router, Comput. Artificial Intelligence, 6 (1987), pp. 229-242.
32. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
33. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
34. P. RAGHAVAN AND C. D. THOMPSON, Multiterminal global routing: A deterministic approximation scheme, Algorithmica, 6 (1991), pp. 73-82.
35. F. SHAHROKHI AND D. W. MATULA, The maximum concurrent flow problem, J. Association for Computing Machinery, 37 (1990), pp. 318-334.
36. E. SHRAGOWITZ AND S. KEEL, A global router based on a multicommodity flow model, Integration, 5 (1987), pp. 3-16.
37. B. S. TING AND B. N. TIEN, Routing techniques for gate array, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2 (1983), pp. 301-312.
38. A. VANNELLI, An adaptation of the interior point method for solving the global routing problem, IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 10 (1991), pp. 193-203.
39. G. ZIMMERMANN, Top-down design of digital systems, in Advances in CAD for VLSI, Volume 2: Logic Design and Simulation, E. Hörbst, ed., North-Holland, New York, 1986, pp. 185-206.
40. G. ZIMMERMANN, A new area and shape function estimation technique for VLSI layouts, in Proceedings of the 25th Design Automation Conference, Anaheim, CA, ACM/IEEE, 1988, pp. 60-65.