{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:37Z","timestamp":1725663097356},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:54:24Z","timestamp":1330196064000},"page":"317-328","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalized river routing \u2014 Algorithms and performance bounds"],"prefix":"10.1007","author":[{"given":"Jean R. S.","family":"Blair","sequence":"first","affiliation":[]},{"given":"Errol L.","family":"Lloyd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"29_CR1","unstructured":"P. B. Arnold, \u201cComplexity for single row routing,\u201d Technical Report TR-22-82, Center for Research in Computing Technology, Harvard University (1982)."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"D. Dolev, K. Karplus, A. Siegel, A. Strong, J. D. Ullman, \u201cOptimal wiring between rectangles,\u201d Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp.312\u2013317 (1981).","DOI":"10.1145\/800076.802484"},{"issue":"3","key":"29_CR3","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/0022-0000(84)90022-9","volume":"28","author":"E. L. Lloyd","year":"1984","unstructured":"E. L. Lloyd S. S. Ravi, \u201cOne-layer routing without component constraints,\u201d Journal of Computer and System Sciences\n28(3), pp.420\u2013438 (June 1984).","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/978-3-642-68402-9_19","volume-title":"VLSI Systems and Computations","author":"R. Y. Pinter","year":"1981","unstructured":"R. Y. Pinter, \u201cOptimal routing in rectilinear channels,\u201d pp. 160\u2013177 in VLSI Systems and Computations, ed. H. T. Kung et al., Computer Science Press, Rockville, Md. (1981)."},{"issue":"3","key":"29_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/TC.1983.1676213","volume":"c-32","author":"R. Raghavan","year":"1983","unstructured":"R. Raghavan S. Sahni, \u201cSingle row routing,\u201d IEEE Transactions on Computers\nc-32(3), pp.209\u2013220 (March 1983).","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"29_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2402.322384","volume":"30","author":"A. L. Rosenberg","year":"1983","unstructured":"A. L. Rosenberg, \u201cThree-dimensional VLSI: A case study,\u201d Journal of the Association for Computing Machinery\n30(3), pp.397\u2013416 (July 1983).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-642-68402-9_17","volume-title":"VLSI Systems and Computations","author":"A. Siegel","year":"1981","unstructured":"A. Siegel D. Dolev, \u201cThe separation for general single-layer wiring barriers,\u201d pp. 143\u2013152 in VLSI Systems and Computations, ed. H. T. Kung et al., Computer Science Press, Rochville, Md. (1981)."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"M. Tompa, \u201cAn optimal solution to a wire-routing problem,\u201d Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp.161\u2013176 (May 1980).","DOI":"10.1145\/800141.804664"},{"issue":"9","key":"29_CR9","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1109\/TCS.1980.1084890","volume":"CAS-27","author":"S. Tsukiyama","year":"1980","unstructured":"S. Tsukiyama, E. S. Kuh, I. Shirakawa, \u201cAn algorithm for single-row routing with prescribed street congestions,\u201d IEEE Transactions on Circuits and Systems\nCAS-27(9), pp.765\u2013771 (1980).","journal-title":"IEEE Transactions on Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:50:43Z","timestamp":1578527443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_29"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}