{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:50Z","timestamp":1759063550184,"version":"3.44.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":[[1990,4]]},"DOI":"10.1016\/0167-9260(90)90034-x","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"163-177","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["An optimum channel routing algorithm in the restricted wire overlap model"],"prefix":"10.1016","volume":"9","author":[{"given":"Dian","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(90)90034-X_BIB1","series-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing","first-page":"477","article-title":"An approximation algorithm for Manhattan routing","author":"Baker","year":"1983"},{"issue":"5","key":"10.1016\/0167-9260(90)90034-X_BIB2","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/T-ED.1985.22046","article-title":"Optimal interconnection circuits for VLSI","volume":"ED-32","author":"Bakoglu","year":"1985","journal-title":"IEEE Trans. Electron. Devices"},{"key":"10.1016\/0167-9260(90)90034-X_BIB3","unstructured":"Brady, M. and M. Sarrafzadeh, Stretching a layout to ensure wirability, IEEE Trans. Computers, to appear."},{"year":"1988","series-title":"Using 45-degree wire to ensure wirability","author":"Chiang","key":"10.1016\/0167-9260(90)90034-X_BIB4"},{"issue":"3","key":"10.1016\/0167-9260(90)90034-X_BIB5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/T-ED.1984.21526","article-title":"Coupling effects in the time domain for an interconnecting Bus in high-speed GaAs logic circuits","volume":"ED-31","author":"Chilo","year":"1984","journal-title":"IEEE Trans. Electron. Devices"},{"issue":"8","key":"10.1016\/0167-9260(90)90034-X_BIB6","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/EDL.1981.25399","volume":"EDL-2","author":"Dang","year":"1981","journal-title":"IEEE Electron. Device Lett."},{"issue":"10","key":"10.1016\/0167-9260(90)90034-X_BIB7","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1109\/TMTT.1967.1126537","volume":"MTT-15","author":"Duncan","year":"1967","journal-title":"IEEE Trans. Microwave Theory Tech."},{"key":"10.1016\/0167-9260(90)90034-X_BIB8","series-title":"Graph Theory Conf.","article-title":"Disjoint paths in a rectilinear grid","author":"Frank","year":"1981"},{"key":"10.1016\/0167-9260(90)90034-X_BIB9","series-title":"Proc. 28th Symp. on Foundations of Comp. Sci.","first-page":"316","article-title":"Channel routing of multiterminal nets","author":"Gao","year":"1987"},{"key":"10.1016\/0167-9260(90)90034-X_BIB10","series-title":"Proc. 8th Design Automation Conf.","first-page":"214","article-title":"Wire routing by optimizing channel assignment","author":"Hashimoto","year":"1971"},{"key":"10.1016\/0167-9260(90)90034-X_BIB11","series-title":"Rec. 7th Asilomar Conf. on Cir. Syst. and Comp.","first-page":"119","article-title":"A routing method of building block LSI","author":"Kawanishi","year":"1973"},{"key":"10.1016\/0167-9260(90)90034-X_BIB12","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/0196-6774(86)90016-7","article-title":"Routing through a generalized switchbox","author":"Kaufmann","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-9260(90)90034-X_BIB13","series-title":"Technical Report VLSI Memo 82-71","article-title":"New Lower Bounds for Cancel Routing","author":"Leighton","year":"1981"},{"issue":"8\/9","key":"10.1016\/0167-9260(90)90034-X_BIB14","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/0038-1101(84)90022-4","article-title":"An analysis of interconnect line capacitance and coupling for VLSI Circuits","volume":"27","author":"Lewis","year":"1984","journal-title":"Solid State Electronics"},{"key":"10.1016\/0167-9260(90)90034-X_BIB15","series-title":"Proc. IEEE Symp. on Circuits and Systems","first-page":"1226","article-title":"Three-side channel, two-adjacent-side channel and their routers","author":"Liu","year":"1986"},{"key":"10.1016\/0167-9260(90)90034-X_BIB16","series-title":"Technical Report ACT-90","article-title":"Lower and Upper Bounds For the General Junction Routing Problem","author":"Maddila","year":"1988"},{"key":"10.1016\/0167-9260(90)90034-X_BIB17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","article-title":"Routing through a rectangle","volume":"33","author":"Mehlhorn","year":"1986","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0167-9260(90)90034-X_BIB18","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01840443","article-title":"Channel routing in knock-knee mode: simplified algorithms and proofs","volume":"1","author":"Mehlhorn","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0167-9260(90)90034-X_BIB19","series-title":"Proc. VLSI: Algorithms and Architectures","first-page":"189","article-title":"Channel routing of nets of bounded degree","author":"Preparata","year":"1984"},{"key":"10.1016\/0167-9260(90)90034-X_BIB20","series-title":"Probably Good Channel Routing Algorithms","first-page":"153","article-title":"VLSI systems and computations","author":"Rivest","year":"1981"},{"issue":"8","key":"10.1016\/0167-9260(90)90034-X_BIB21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/JSSC.1973.1050400","volume":"SC-8","author":"Ruehli","year":"1973","journal-title":"IEEE J. Solid State Circuits"},{"issue":"2","key":"10.1016\/0167-9260(90)90034-X_BIB22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/T-ED.1983.21093","article-title":"Simple formulas for two- and three-dimensional capacitance","volume":"ED-30","author":"Sakurai","year":"1983","journal-title":"IEEE Trans. Electron Devices"},{"key":"10.1016\/0167-9260(90)90034-X_BIB23","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1109\/JSSC.1982.1051729","article-title":"Effect of scaling of interconnections on the time delay of VLSI circuits","volume":"SC-17","author":"Saraswat","year":"1982","journal-title":"IEEE J. Solid State Circuits"},{"key":"10.1016\/0167-9260(90)90034-X_BIB24","article-title":"Hierarchical approaches to circuit layout","author":"Sarrafzadeh","year":"1986","journal-title":"Ph.D. Thesis"},{"year":"1984","series-title":"Computational. Aspects of VLSI","author":"Ullman","key":"10.1016\/0167-9260(90)90034-X_BIB25"},{"issue":"1","key":"10.1016\/0167-9260(90)90034-X_BIB26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TCAD.1982.1269993","article-title":"Efficient algorithms for channel routing","volume":"1","author":"Yoshimura","year":"1982","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/0167-9260(90)90034-X_BIB27","unstructured":"Zhou, D., F.P. Preparata and S.M. Kang, Interconnection delay in very high-speed VLSI, ICCD '88 Proceedings."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609090034X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609090034X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:36:57Z","timestamp":1757453817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792609090034X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["016792609090034X"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(90)90034-x","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1990,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An optimum channel routing algorithm in the restricted wire overlap model","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(90)90034-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}