{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:40:01Z","timestamp":1759138801209,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0167-9260(02)00024-x","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T13:17:57Z","timestamp":1032268677000},"page":"159-182","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probability-driven routing in a datapath environment"],"prefix":"10.1016","volume":"31","author":[{"given":"Suresh","family":"Raman","sequence":"first","affiliation":[]},{"given":"Sachin S.","family":"Sapatnekar","sequence":"additional","affiliation":[]},{"given":"Charles J.","family":"Alpert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-9260(02)00024-X_BIB1","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 Design"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB2","series-title":"VLSI Circuit Layout: Theory and Design","first-page":"144","article-title":"A decomposition algorithm for circuit routing","author":"Hu","year":"1985"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB3","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(02)00024-X_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01759035","article-title":"Multiterminal global routing","volume":"6","author":"Raghavan","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB5","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 IV","year":"1996","journal-title":"IEEE Trans. Comput.-Aided Design"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB6","first-page":"1746","article-title":"Global routing based on the multi-commodity network flow method","volume":"10","author":"Yoichi","year":"1993","journal-title":"IEICE Trans. Fundamentals Electron. Commun. Comput. Sci."},{"key":"10.1016\/S0167-9260(02)00024-X_BIB7","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. Assoc. Comput. Machinery"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB8","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"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB9","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."},{"key":"10.1016\/S0167-9260(02)00024-X_BIB10","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/43.62776","article-title":"Global routing based on Steiner min-max trees","volume":"9","author":"Chiang","year":"1990","journal-title":"IEEE Trans. Comput.-Aided Design"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB11","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1109\/43.137503","article-title":"The effective solution of integer programs for hierarchical global routing","volume":"10","author":"Heisterman","year":"1991","journal-title":"IEEE Trans. Comput.-Aided Design"},{"issue":"2","key":"10.1016\/S0167-9260(02)00024-X_BIB12","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/92.678873","article-title":"FPGA routing and routability estimation via boolean satisfiability","volume":"6","author":"Wood","year":"1998","journal-title":"IEEE Trans. Very Large Scale Integration Syst"},{"key":"10.1016\/S0167-9260(02)00024-X_BIB13","doi-asserted-by":"crossref","unstructured":"S.S. Sapatnekar, S.M. Kang, Design Automation for Timing-driven Layout Synthesis, Kluwer Academic, Boston, MA, 1993, pp. 56\u201360.","DOI":"10.1007\/978-1-4615-3178-4"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016792600200024X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016792600200024X?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:09Z","timestamp":1759137069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016792600200024X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S016792600200024X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(02)00024-x","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2002,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Probability-driven routing in a datapath environment","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(02)00024-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}