{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:35:36Z","timestamp":1648924536650},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0304-3975(97)00286-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"31-49","source":"Crossref","is-referenced-by-count":0,"title":["Switchbox routing in VLSI design: Closing the complexity gap"],"prefix":"10.1016","volume":"203","author":[{"given":"Stephan","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus W.","family":"Sch\u00e4ffter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00286-7_BIB1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.1993.1041","article-title":"Routing through a dense channel with minimum total wire length","volume":"15","author":"Formann","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB2","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01432359","article-title":"Routing in grid graphs by cutting planes, ZOR","volume":"41","author":"Gr\u00f6tschel","year":"1995","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/S0304-3975(97)00286-7_BIB4","article-title":"On the NP-completeness of channel and switchbox routing problems","author":"Hartmann","year":"1996"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB5","series-title":"Paths, Flows and VLSI-Layout","first-page":"185","article-title":"Steiner trees in VLSI-layout","author":"Korte","year":"1990"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB6","series-title":"VLSI theory","first-page":"129","article-title":"The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits","volume":"vol. 2","author":"Kramer","year":"1984"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB7","series-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0167-9260(92)90017-S","article-title":"Switch box routing: a retrospective","volume":"13","author":"Marck-Sadowska","year":"1992","journal-title":"Integration VLSI J."},{"key":"10.1016\/S0304-3975(97)00286-7_BIB9","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. Assoc. for Comput. Mach."},{"key":"10.1016\/S0304-3975(97)00286-7_BIB10","article-title":"Manhattan channel routing is NP-complete under truly restricted settings","author":"Middendorf","year":"1993"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB11","series-title":"Network Routing","first-page":"625","article-title":"VLSI network design","volume":"vol. 8","author":"M\u00f6hring","year":"1995"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB12","first-page":"75","article-title":"Multicommodity flows in planar graphs","volume":"31","author":"Okamura","year":"1981","journal-title":"J. Comput. Theory"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TCAD.1987.1270298","article-title":"Channel-routing problem in the knock-knee mode is NP-complete","volume":"6","author":"Sarrafzadeh","year":"1987","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"10.1016\/S0304-3975(97)00286-7_BIB14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TCAD.1985.1270096","article-title":"Dogleg channel-routing is NP-complete","volume":"4","author":"Szymanski","year":"1985","journal-title":"IEEE Trans. Comput. Aided Design"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002867?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002867?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:01:35Z","timestamp":1555405295000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0304397597002867"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00286-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}