{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:58Z","timestamp":1757626258118,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":[[1989,10]]},"DOI":"10.1016\/0167-9260(89)90070-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"17-39","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Switchbox routing using score function"],"prefix":"10.1016","volume":"8","author":[{"given":"Kok-Phuang","family":"Tan","sequence":"first","affiliation":[]},{"given":"Tiow-Seng","family":"Tan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(89)90070-9_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230070104","article-title":"Rectilinear steiner trees: efficient special-case algorithms","volume":"7","author":"Aho","year":"1977","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0167-9260(89)90070-9_BIB2","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":"2","key":"10.1016\/0167-9260(89)90070-9_BIB3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/TCAD.1985.1270110","article-title":"Solution to a switchbox routing problem","volume":"CAD-4","author":"Deutsch","year":"1985","journal-title":"IEEE Trans. on Comput. Aided-Des."},{"key":"10.1016\/0167-9260(89)90070-9_BIB4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1971","journal-title":"Networks"},{"issue":"4","key":"10.1016\/0167-9260(89)90070-9_BIB5","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear steiner tree problem is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0167-9260(89)90070-9_BIB6","article-title":"Net wiring for large scale integrated circuits","author":"Hanan","year":"1965","journal-title":"IBM Research Report RC 1375"},{"issue":"2","key":"10.1016\/0167-9260(89)90070-9_BIB7","doi-asserted-by":"crossref","first-page":"155","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\/0167-9260(89)90070-9_BIB8","series-title":"Proc. 21st Design Automation Conf.","first-page":"117","article-title":"A switchbox router with obstacle avoidance","author":"Hamachi","year":"1984"},{"key":"10.1016\/0167-9260(89)90070-9_BIB9","series-title":"Proc. 19th Design Automation Conf.","first-page":"46","article-title":"A new two-dimensional routing algorithm","author":"Hsu","year":"1982"},{"key":"10.1016\/0167-9260(89)90070-9_BIB10","series-title":"VLSI Circuit Layout: Theory and Design","first-page":"144","article-title":"A decomposition algorithm for circuit routing","author":"Hu","year":"1985"},{"issue":"1","key":"10.1016\/0167-9260(89)90070-9_BIB11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1137\/0130013","article-title":"On Steiner minimal trees with rectilinear distance","volume":"30","author":"Hwang","year":"1976","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"10.1016\/0167-9260(89)90070-9_BIB12","first-page":"303","article-title":"The rectilinear steiner problem","author":"Hwang","year":"1978","journal-title":"J. Design Automation and Fault-Tolerant Computing"},{"issue":"1","key":"10.1016\/0167-9260(89)90070-9_BIB13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TCS.1979.1084551","article-title":"An O(n log n) algorithm for suboptimal rectilinear steiner trees","volume":"CAS-26","author":"Hwang","year":"1979","journal-title":"IEEE Trans. Circuits Syst."},{"year":"1986","series-title":"An Artificial Intelligence Approach to VLSI Routing","author":"Joobbani","key":"10.1016\/0167-9260(89)90070-9_BIB14"},{"key":"10.1016\/0167-9260(89)90070-9_BIB15","series-title":"Proc. 22nd Design Automation Conf.","first-page":"266","article-title":"WEAVER: a knowledge-based routing expert","author":"Joobbani","year":"1985"},{"issue":"4","key":"10.1016\/0167-9260(89)90070-9_BIB16","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\/0167-9260(89)90070-9_BIB17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-9260(85)90029-X","article-title":"A greedy switch-box router","volume":"3","author":"Luk","year":"1985","journal-title":"Integration"},{"key":"10.1016\/0167-9260(89)90070-9_BIB18","series-title":"Proc. 22nd Design Automation Conf.","first-page":"117","article-title":"Two-dimensional router for double layer layout","author":"Malgorzata","year":"1985"},{"key":"10.1016\/0167-9260(89)90070-9_BIB19","series-title":"Proc. 19th Design Automation Conf.","first-page":"418","article-title":"A \u2018greedy\u2019 channel router","author":"Rivest","year":"1982"},{"key":"10.1016\/0167-9260(89)90070-9_BIB20","series-title":"Proc. Intl. Conf. on Computer-Aided Design","first-page":"2","article-title":"MIGHTY: a \u2018rip-up and route\u2019 detail router","author":"Shin","year":"1986"},{"key":"10.1016\/0167-9260(89)90070-9_BIB21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1080\/03052158008902421","article-title":"an O(N log N) heuristic algorithm for the rectilinear steiner minimal tree problem","author":"Smith","year":"1980","journal-title":"Eng. Optim."},{"key":"10.1016\/0167-9260(89)90070-9_BIB22","series-title":"Proc. International Conf. on Circuits and Computer","first-page":"256","article-title":"A new area router, the LRS algorithm","author":"Smith","year":"1982"},{"key":"10.1016\/0167-9260(89)90070-9_BIB23","first-page":"1281","article-title":"Circuit layout","volume":"69","author":"Soukup","year":"1981"},{"key":"10.1016\/0167-9260(89)90070-9_BIB24","series-title":"Proc. 19th Design Automation Conf.","first-page":"104","article-title":"A minimum-impact routing algorithm","author":"Supowit","year":"1982"},{"key":"10.1016\/0167-9260(89)90070-9_BIB25","series-title":"Proc. 21st Design Automation Conf.","first-page":"38","article-title":"An efficient channel router","author":"Yoshimura","year":"1984"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900709?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900709?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:36Z","timestamp":1757453796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926089900709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0167926089900709"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(89)90070-9","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1989,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Switchbox routing using score function","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(89)90070-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}