{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:32:03Z","timestamp":1757626323392,"version":"3.44.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":[[1996,3]]},"DOI":"10.1016\/0167-9260(95)00024-0","type":"journal-article","created":{"date-parts":[[2004,5,26]],"date-time":"2004-05-26T13:39:26Z","timestamp":1085578766000},"page":"193-209","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient lower bound algorithm for channel routing"],"prefix":"10.1016","volume":"20","author":[{"given":"Heng-Yi","family":"Chao","sequence":"first","affiliation":[]},{"given":"Mary P.","family":"Harper","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1976","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0167-9260(95)00024-0_BIB1"},{"article-title":"Finding a tighter lower bound for optimization problems with capacity and precedence constraints","year":"1995","author":"Chao","key":"10.1016\/0167-9260(95)00024-0_BIB2"},{"key":"10.1016\/0167-9260(95)00024-0_BIB3","series-title":"Proc. Sixth IASTEDIISMM Internat. Conf. on Parallel and Distributed Computing and Systems","first-page":"294","article-title":"Minimizing redundant dependencies and interprocessor synchronizations","author":"Chao","year":"1994"},{"article-title":"Scheduling a superscalar pipelined processor without hardware interlocks","year":"1994","author":"Chao","key":"10.1016\/0167-9260(95)00024-0_BIB4"},{"article-title":"A difficult channel routing generator","year":"1995","author":"Chao","key":"10.1016\/0167-9260(95)00024-0_BIB5"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/0167-9260(95)00024-0_BIB6"},{"issue":"7","key":"10.1016\/0167-9260(95)00024-0_BIB7","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TC.1981.1675826","article-title":"Some experiments in local microcode compaction for horizontal machines","volume":"C-30","author":"Davidson","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-9260(95)00024-0_BIB8","series-title":"Proc. 13th Design Automation Conf.","first-page":"425","article-title":"A dogleg channel router","author":"Deutsch","year":"1976"},{"issue":"7","key":"10.1016\/0167-9260(95)00024-0_BIB9","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1981.1675827","article-title":"Trace scheduling: A technique for global microcode compaction","volume":"C-30","author":"Fisher","year":"1981","journal-title":"IEEE Trans. Comput."},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/0167-9260(95)00024-0_BIB10"},{"key":"10.1016\/0167-9260(95)00024-0_BIB11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0167-6423(89)90039-7","article-title":"An algorithm for transitive reduction of an acyclic graph","volume":"12","author":"Gries","year":"1989","journal-title":"Sci. Comput. Program."},{"issue":"10","key":"10.1016\/0167-9260(95)00024-0_BIB12","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/43.170984","article-title":"Topological channel routing","volume":"11","author":"Haruyama","year":"1992","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/0167-9260(95)00024-0_BIB13","series-title":"Proc. 8th Annual Design Automation Workshop","first-page":"155","article-title":"Wire routing by optimizing channel assignment within large apertures","author":"Hashimoto","year":"1971"},{"issue":"7","key":"10.1016\/0167-9260(95)00024-0_BIB14","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1109\/43.238033","article-title":"A density-based greedy router","volume":"12","author":"Ho","year":"1993","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"2","key":"10.1016\/0167-9260(95)00024-0_BIB15","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/43.68407","article-title":"A general greedy channel routing algorithm","volume":"10","author":"Ho","year":"1991","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/0167-9260(95)00024-0_BIB16","series-title":"Proc. of the 10th Design Automation Workshop","first-page":"50","article-title":"An optimum channel-routing algorithm for polycell layouts of integrated circuits","author":"Kemighan","year":"1973"},{"key":"10.1016\/0167-9260(95)00024-0_BIB17","first-page":"11","article-title":"An improved lower bound for channel routing problems","volume":"4","author":"Lee","year":"1991"},{"key":"10.1016\/0167-9260(95)00024-0_BIB18","first-page":"1179","article-title":"An efficient optimum channel routing algorithm","volume":"Vol. 2","author":"Lin","year":"1991"},{"volume":"Vol. 4","year":"1986","author":"Ohtsuki","key":"10.1016\/0167-9260(95)00024-0_BIB19"},{"key":"10.1016\/0167-9260(95)00024-0_BIB20","series-title":"Proc. IEEE Region 10 Conf. on Computer, Communication, Control and Power Engineering","first-page":"507","article-title":"A new lower bound for channel routing","author":"Pal","year":"1993"},{"issue":"3","key":"10.1016\/0167-9260(95)00024-0_BIB21","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TCAD.1985.1270117","article-title":"A new symbolic channel router: YACR2","volume":"CAD-4","author":"Reed","year":"1985","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"10.1016\/0167-9260(95)00024-0_BIB22","series-title":"19th Design Automation Conf.","article-title":"A greedy channel router","author":"Rivest","year":"1981"},{"issue":"5","key":"10.1016\/0167-9260(95)00024-0_BIB23","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1016\/0167-8191(92)90085-L","article-title":"Adoptability and effectiveness of microcode compaction algorithms in superscalar processing","volume":"18","author":"Shiau","year":"1992","journal-title":"Parallel Comput."},{"issue":"2","key":"10.1016\/0167-9260(95)00024-0_BIB24","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0045-7906(91)90006-L","article-title":"An efficient approach for channel routing in VLSI","volume":"17","author":"Soh","year":"1991","journal-title":"Comput. Elect. Eng."},{"issue":"1","key":"10.1016\/0167-9260(95)00024-0_BIB25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TCAD.1985.1270096","article-title":"Dogleg channel routing is NP-complete","volume":"CAD-4","author":"Szymanski","year":"1985","journal-title":"IEEE Trans. on Computer-Aided Design"},{"issue":"7","key":"10.1016\/0167-9260(95)00024-0_BIB26","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1109\/12.55698","article-title":"An efficient channel routing algorithm to yield an optimal solution","volume":"39","author":"Wang","year":"1990","journal-title":"IEEE Trans. on Computers"},{"issue":"2","key":"10.1016\/0167-9260(95)00024-0_BIB27","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/43.68409","article-title":"A robust channel router","volume":"10","author":"Yoeli","year":"1991","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/0167-9260(95)00024-0_BIB28","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TCAD.1982.1269993","article-title":"Efficient algorithms for channel routing","volume":"CAD-1","author":"Yoshimura","year":"1982","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926095000240?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:40Z","timestamp":1757453800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926095000240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0167926095000240"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(95)00024-0","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1996,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient lower bound algorithm for channel routing","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(95)00024-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}