{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:23:02Z","timestamp":1769278982620,"version":"3.49.0"},"reference-count":93,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0167-9260(01)00020-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T05:59:34Z","timestamp":1027576774000},"page":"1-49","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":70,"title":["A survey on multi-net global routing for integrated circuits"],"prefix":"10.1016","volume":"31","author":[{"given":"Jiang","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sachin S.","family":"Sapatnekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(01)00020-7_BIB1","series-title":"VLSI Circuit Layout: Theory and Design","author":"Hu","year":"1985"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB2","series-title":"Advances in Computing Research, Vol. 2: VLSI Theory","first-page":"129","article-title":"The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits","author":"Kramer","year":"1984"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB3","series-title":"Layout Design and Verification","first-page":"169","article-title":"Global routing","author":"Kuh","year":"1986"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB4","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB5","series-title":"Algorithms for VLSI Physical Design Automation","author":"Sherwani","year":"1999"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB6","series-title":"VLSI Physical Design Automation: Theory and Practice","author":"Sait","year":"1995"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB7","series-title":"An Introduction to VLSI Physical Design","author":"Sarrafzadeh","year":"1996"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB8","series-title":"On Optimal Interconnections for VLSI","author":"Kahng","year":"1995"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(96)00008-9","article-title":"Performance optimization of VLSI interconnect layout","volume":"21","author":"Cong","year":"1996","journal-title":"Integration: VLSI J."},{"issue":"3","key":"10.1016\/S0167-9260(01)00020-7_BIB10","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","article-title":"An algorithm for path connection and its applications","volume":"EC-10","author":"Lee","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB11","unstructured":"E.F. Moore, Shortest path through a maze, in: Annals of Computation Laboratory, Harvard University Press, Cambridge, MA, 1959, pp. 285\u2013292."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB13","doi-asserted-by":"crossref","unstructured":"D.W. Hightower, A solution to line routing problems on the continuous plane, The Sixth Design Automation Workshop, 1969, pp. 1\u201324.","DOI":"10.1145\/800260.809014"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB14","doi-asserted-by":"crossref","unstructured":"R. Nair, S.J. Hong, S. Liles, R. Villani, Global wiring on a wire routing machine, Proceedings of the ACM\/IEEE Design Automation Conference, 1982, pp. 224\u2013231.","DOI":"10.1109\/DAC.1982.1585505"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB15","doi-asserted-by":"crossref","unstructured":"S.-W. Hur, A. Jagannathan, J. Lillis, Timing driven maze routing, Proceedings of the ACM International Symposium on Physical Design, 1999, pp. 208\u2013213.","DOI":"10.1145\/299996.300079"},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/43.828552","article-title":"Timing-driven maze routing","volume":"19","author":"Hur","year":"2000","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"7","key":"10.1016\/S0167-9260(01)00020-7_BIB17","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/43.391737","article-title":"Prim-dijkstra tradeoffs for improved performance-driven routing tree design","volume":"14","author":"Alpert","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"6","key":"10.1016\/S0167-9260(01)00020-7_BIB18","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/43.137519","article-title":"Provably good performance driven global routing","volume":"11","author":"Cong","year":"1992","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"12","key":"10.1016\/S0167-9260(01)00020-7_BIB19","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.1109\/43.476573","article-title":"Near-optimal critical sink routing tree constructions","volume":"14","author":"Boese","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB20","doi-asserted-by":"crossref","unstructured":"J. Cong, C.K. Koh, Interconnect layout optimization under higher-order RLC model, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1997, pp. 713\u2013720.","DOI":"10.1109\/ICCAD.1997.643617"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB21","doi-asserted-by":"crossref","unstructured":"J. Cong, K.-S. Leung, D. Zhou, Performance driven interconnect design based on distributed RC delay model, Proceedings of the ACM\/IEEE Design Automation Conference, 1993, pp. 606\u2013611.","DOI":"10.1145\/157485.165065"},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB22","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/43.752927","article-title":"Non-Hanan routing","volume":"18","author":"Hou","year":"1999","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB23","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/43.838994","article-title":"Algorithms for non-Hanan-based optimization for VLSI interconnect under a higher order AWE model","volume":"19","author":"Hu","year":"2000","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB24","doi-asserted-by":"crossref","unstructured":"J. Lillis, C.K. Cheng, T.T. Lin, C.Y. Ho, New performance driven routing techniques with explicit area\/delay tradeoff and simultaneous wire sizing, Proceedings of the ACM\/IEEE Design Automation Conference, 1996, pp. 395\u2013400.","DOI":"10.1109\/DAC.1996.545608"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB25","doi-asserted-by":"crossref","unstructured":"A. Vittal, M. Marek-Sadowska, Minimum delay interconnect design using alphabetic trees, Proc. ACM\/IEEE Design Automation Conference, 1994, pp. 392\u2013396.","DOI":"10.1145\/196244.196432"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB26","series-title":"Interconnect Analysis and Synthesis","author":"Cheng","year":"2000"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB27","doi-asserted-by":"crossref","unstructured":"C. Albrecht, Provably good global routing by a new approximation algorithm for multicommodity flow, Proceedings of the ACM International Symposium on Physical Design, 2000, pp. 19\u201325.","DOI":"10.1145\/332357.332368"},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB28","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/43.486666","article-title":"A global router with a theoretical bound on the optimal solution","volume":"15","author":"Carden","year":"1996","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB29","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB30","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB31","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","article-title":"Randomized rounding: a technique for provably good algorithms and algorithmic proofs","volume":"7","author":"Raghavan","year":"1987","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB32","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/43.68406","article-title":"An adaptation of the interior point method for solving the global routing problem","volume":"10","author":"Vannelli","year":"1991","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB33","series-title":"VLSI Circuit Layout: Theory and Design","first-page":"3","article-title":"Theory and concepts of circuit layout","author":"Hu","year":"1985"},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB34","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TCAD.1983.1270040","article-title":"Hierarchical wire routing","volume":"CAD-2","author":"Burstein","year":"1983","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"6","key":"10.1016\/S0167-9260(01)00020-7_BIB35","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/43.137503","article-title":"The efficient solution of integer programs for hierarchical global routing","volume":"10","author":"Heisterman","year":"1991","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB36","series-title":"VLSI Circuit Layout: Theory and Design","first-page":"144","article-title":"A decomposition algorithm for circuit routing","author":"Hu","year":"1985"},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB37","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TCAD.1987.1270300","article-title":"A hierarchical global wiring algorithm for custom chip design","volume":"CAD-6","author":"Luk","year":"1987","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"12","key":"10.1016\/S0167-9260(01)00020-7_BIB38","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/43.180262","article-title":"A new global router using zero-one integer linear programming techniques for sea-of-gates and custom logic arrays","volume":"12","author":"Thaik","year":"1992","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB39","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB40","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"issue":"9","key":"10.1016\/S0167-9260(01)00020-7_BIB41","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/43.720316","article-title":"Four-bend top-down global routing","volume":"17","author":"Cho","year":"1998","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB42","unstructured":"J. Hu, S.S. Sapatnekar, A timing-constrained algorithm for simultaneous global routing of multiple nets, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 2000, pp. 99\u2013103."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB43","doi-asserted-by":"crossref","unstructured":"G. Meixner, U. Lauther, A new global router based on a flow model and linear assignment, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1990, pp. 44\u201347.","DOI":"10.1109\/ICCAD.1990.129836"},{"issue":"11","key":"10.1016\/S0167-9260(01)00020-7_BIB44","doi-asserted-by":"crossref","first-page":"1227","DOI":"10.1109\/T-C.1972.223482","article-title":"On the ordering of connections for automatic wire routing","volume":"G-21","author":"Abel","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB45","unstructured":"N. Hasan, C.L. Liu, A force-directed global router, in: Advanced Research in VLSI, Proceedings of the 1987 Stanford Conference, MIT Press, Cambridge, MA, 1987, pp. 135\u2013150."},{"issue":"12","key":"10.1016\/S0167-9260(01)00020-7_BIB46","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/43.62776","article-title":"Global routing based on Steiner min\u2013max trees","volume":"9","author":"Chiang","year":"1990","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"12","key":"10.1016\/S0167-9260(01)00020-7_BIB47","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1109\/43.331403","article-title":"A weighted Steiner tree-based global router with simultaneous length and density minimization","volume":"13","author":"Chiang","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB48","first-page":"298","article-title":"Global routing for gate array","volume":"CAD-3","author":"Li","year":"1984","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB49","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB50","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TCAD.1983.1270039","article-title":"Global wiring by simulated annealing","volume":"CAD.2","author":"Vecchi","year":"1983","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB51","doi-asserted-by":"crossref","unstructured":"C. Sechen, A. Sangiovanni-Vincentelli, TimberWolf3.2: a new standard cell placement and global routing package, Proceedings of the ACM\/IEEE Design Automation Conference, 1986, pp. 432\u2013439.","DOI":"10.1109\/DAC.1986.1586125"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB52","unstructured":"Y.-A. Chen, Y.-L. Lin, Y.-C. Hsu, A new global router for ASIC design based on simulated evolution, International Symposium on VLSI Technology, Systems and Applications, 1989, pp. 261\u2013265."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB53","unstructured":"H. Esbensen, A macro-cell global router based on two genetic algorithms, Proceedings of the European Design Automation Conference, 1994, pp. 428\u2013433."},{"issue":"3","key":"10.1016\/S0167-9260(01)00020-7_BIB54","first-page":"175","article-title":"Timing-driven global routing for standard-cell VLSI design","volume":"14","author":"Youssef","year":"1999","journal-title":"Comput. Systems Sci. Eng."},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB55","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TCAD.1983.1270048","article-title":"Routing techniques for gate array","volume":"CAD-2","author":"Ting","year":"1983","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB56","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TCAD.1987.1270260","article-title":"A simple yet effective technique for global wiring","volume":"CAD-6","author":"Nair","year":"1987","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB57","unstructured":"K.W. Lee, C. Sechen, A global router for sea-of-gate circuits, Proceedings of the European Design Automation Conference, 1991, pp. 242\u2013247."},{"issue":"10","key":"10.1016\/S0167-9260(01)00020-7_BIB58","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/43.790621","article-title":"Multilayer chip-level global routing using an efficient graph-based Steiner tree heuristic","volume":"18","author":"Liu","year":"1999","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB59","unstructured":"S.M. Wang, A multiple source algorithm for suboptimal steiner trees in graphs, in: H. Noltemeier (Ed.), The Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, 1985, pp. 387\u2013396."},{"issue":"1","key":"10.1016\/S0167-9260(01)00020-7_BIB60","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-9260(87)80003-2","article-title":"A global router based on a multicommodity flow model","volume":"5","author":"Shragowitz","year":"1987","journal-title":"Integration: VLSI J."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB61","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01759035","article-title":"Multiterminal global routing: a deterministic approximation scheme","volume":"6","author":"Raghavan","year":"1991","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB62","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","article-title":"The maximum concurrent flow problem","volume":"37","author":"Shahrokhi","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB63","doi-asserted-by":"crossref","unstructured":"N. Garg, J. K\u00f6nemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, Proceedings of Symposium on Foundations of Computer Science, 1998, pp. 300\u2013309.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB64","doi-asserted-by":"crossref","unstructured":"M. Hayashi, S. Tsukiyama, A hybrid hierarchical approach for multi-layer global routing, Proceedings of the European Design and Test Conference, 1995, pp. 492\u2013496.","DOI":"10.1109\/EDTC.1995.470356"},{"issue":"10","key":"10.1016\/S0167-9260(01)00020-7_BIB65","first-page":"1694","article-title":"A hierarchical global router for macro-block-embedded sea-of-gates","volume":"E76-A","author":"Kuribayashi","year":"1993","journal-title":"IEICE Trans. Fundamentals"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB66","unstructured":"U.P. Lauther, Top down hierarchical global routing for channelless gate arrays based on linear assignment, Proceedings of the IFIP International Conference on VLSI, 1987, pp. 141\u2013151."},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB67","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/43.46781","article-title":"Hybrid routing","volume":"9","author":"Lin","year":"1990","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB68","unstructured":"M. Marek-Sadowska, Global router for gate array, Proceedings of the IEEE International Conference on Computer Design, 1984, pp. 332\u2013337."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB69","unstructured":"M. Marek-Sadowska, Route planner for custom chip design, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1986, pp. 246\u2013249."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB70","doi-asserted-by":"crossref","unstructured":"T.-M. Parng, R.-S. Tsay, A new approach to sea-of-gates global routing, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1989, pp. 52\u201355.","DOI":"10.1109\/ICCAD.1989.76903"},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB71","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TCAD.1985.1270104","article-title":"Hierarchical VLSI routing\u2014an approximate routing procedure","volume":"CAD-4","author":"Patel","year":"1985","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"5","key":"10.1016\/S0167-9260(01)00020-7_BIB72","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1109\/TCAD.1987.1270324","article-title":"Hierarchical loose routing for gate arrays","volume":"CAD-6","author":"Winter","year":"1987","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB73","unstructured":"J. Cong, B. Preas, A new algorithm for standard cell global routing, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1988, pp. 176\u2013179."},{"issue":"1","key":"10.1016\/S0167-9260(01)00020-7_BIB74","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-9260(92)90010-V","article-title":"A new algorithm for standard cell global routing","volume":"14","author":"Cong","year":"1992","journal-title":"Integration: VLSI J."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB75","doi-asserted-by":"crossref","unstructured":"J. Cong, P.H. Madden, Performance driven global routing for standard cell design, Proceedings of the ACM International Symposium on Physical Design, 1997, pp. 73\u201380.","DOI":"10.1145\/267665.267689"},{"issue":"11","key":"10.1016\/S0167-9260(01)00020-7_BIB76","doi-asserted-by":"crossref","first-page":"1323","DOI":"10.1109\/43.663822","article-title":"TIGER: an efficient timing-driven global router for gate array and standard cell layout design","volume":"16","author":"Hong","year":"1997","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB77","doi-asserted-by":"crossref","unstructured":"J. Huang, X.-L. Hong, C.-K. Cheng, E.S. Kuh, An efficient timing-driven global routing algorithm, Proceedings of the ACM\/IEEE Design Automation Conference, 1993, pp. 596\u2013600.","DOI":"10.1145\/157485.165063"},{"issue":"10","key":"10.1016\/S0167-9260(01)00020-7_BIB78","first-page":"1410","article-title":"An efficient timing-driven global routing method for standard cell layout","volume":"E79-D","author":"Koide","year":"1996","journal-title":"IEICE Trans. Inform. Systems"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB79","unstructured":"D. Wang, E.S. Kuh, Performance-driven interconnect global routing, Proceedings of the Great Lake Symposium on VLSI, 1996, pp. 132\u2013136."},{"issue":"3","key":"10.1016\/S0167-9260(01)00020-7_BIB80","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1109\/43.365123","article-title":"Optimal wiresizing under the distributed Elmore delay model","volume":"14","author":"Cong","year":"1995","journal-title":"IEEE Trans. Comput.-Aided Des."},{"issue":"4","key":"10.1016\/S0167-9260(01)00020-7_BIB81","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1109\/92.335010","article-title":"Simultaneous driver and wire sizing for performance and power optimization","volume":"2","author":"Cong","year":"1994","journal-title":"IEEE Trans. VLSI Systems"},{"issue":"2","key":"10.1016\/S0167-9260(01)00020-7_BIB82","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","article-title":"On Steiner's problem with rectilinear distance","volume":"14","author":"Hanan","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB83","unstructured":"K.D. Wayne, L. Fleischer, Fast and simple approximation schemes for generalized flow, Proceedings of the 10th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 981\u2013982."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB84","doi-asserted-by":"crossref","unstructured":"H. Zhou, D.F. Wong, Global routing with crosstalk constraints, Proceedings of the ACM\/IEEE Design Automation Conference, 1998, pp. 374\u2013377.","DOI":"10.1145\/277044.277147"},{"issue":"11","key":"10.1016\/S0167-9260(01)00020-7_BIB85","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1109\/43.806813","article-title":"Global routing with crosstalk constraints","volume":"18","author":"Zhou","year":"1999","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB86","doi-asserted-by":"crossref","unstructured":"T. Xue, E.S. Kuh, D. Wang, Post global routing crosstalk risk estimation and reduction, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1996, pp. 302\u2013309.","DOI":"10.1109\/ICCAD.1996.569714"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB87","series-title":"Circuits, Interconnections and Packaging for VLSI","author":"Bakoglu","year":"1990"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB88","unstructured":"J. Cong, Challenges and opportunities for design innovations in nanometer technologies, SRC Design Sciences Concept Paper, 1997."},{"key":"10.1016\/S0167-9260(01)00020-7_BIB89","doi-asserted-by":"crossref","unstructured":"J. Cong, T. Kong, D.Z. Pan, Buffer block planning for interconnect-driven floorplanning, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 1999, pp. 358\u2013363.","DOI":"10.1109\/ICCAD.1999.810675"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB90","doi-asserted-by":"crossref","unstructured":"F.F. Dragan, A.B. Kahng, I. Mandoiu, S. Muddu, Provably good global buffering using an available buffer block plan, Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, 2000, pp. 104\u2013109.","DOI":"10.1109\/ICCAD.2000.896458"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB91","doi-asserted-by":"crossref","unstructured":"P. Sarkar, V. Sundararaman, C.-K. Koh, Routability-driven repeater block planning for interconnect-centric floorplanning, Proceedings of the ACM International Symposium on Physical Design, 2000, pp. 186\u2013191.","DOI":"10.1145\/332357.332398"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB92","doi-asserted-by":"crossref","unstructured":"X. Tang, D.F. Wong, Planning buffer locations by network flows, Proceedings of the ACM International Symposium on Physical Design, 2000, pp. 180\u2013185.","DOI":"10.1145\/332357.332397"},{"key":"10.1016\/S0167-9260(01)00020-7_BIB93","doi-asserted-by":"crossref","unstructured":"C.J. Alpert, J. Hu, S.S. Sapatnekar, P.G. Villarrubia, A practical methodology for early buffer and wire resource allocation, Proceedings of the ACM\/IEEE Design Automation Conference, 2001, pp. 189\u2013194.","DOI":"10.1145\/378239.378461"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926001000207?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926001000207?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:11:30Z","timestamp":1759137090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926001000207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":93,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0167926001000207"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(01)00020-7","relation":{},"ISSN":["0167-9260"],"issn-type":[{"value":"0167-9260","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A survey on multi-net global routing for integrated circuits","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(01)00020-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}