{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T02:47:32Z","timestamp":1648781252734},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0196-6774(89)90025-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"86-108","source":"Crossref","is-referenced-by-count":0,"title":["On the computational complexity of continuous routing"],"prefix":"10.1016","volume":"10","author":[{"given":"Yukon","family":"Chang","sequence":"first","affiliation":[]},{"given":"Susanne","family":"Hambrusch","sequence":"additional","affiliation":[]},{"given":"Janos","family":"Simon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(89)90025-4_BIB1","series-title":"Proceedings, 1st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing","first-page":"60","article-title":"Randomized parallel communication","author":"Aleliunas","year":"1982"},{"issue":"No. 1","key":"10.1016\/0196-6774(89)90025-4_BIB2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","article-title":"Routing, merging and sorting on parallel models of computation","volume":"30","author":"Borodin","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(89)90025-4_BIB3","article-title":"Continuous Message Routing on Processor Arrays","author":"Chang","year":"1986"},{"key":"10.1016\/0196-6774(89)90025-4_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0196-6774(89)90025-4_BIB5","first-page":"259","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(89)90025-4_BIB6","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1002\/net.3230120410","article-title":"Efficient algorithms for interval graphs and circular-arc graphs","volume":"12","author":"Gupta","year":"1982","journal-title":"Networks"},{"issue":"No. 2","key":"10.1016\/0196-6774(89)90025-4_BIB7","first-page":"360","article-title":"An efficient general-purpose parallel computer","volume":"30","author":"Galil","year":"1983","journal-title":"J. Amer. Chem. Soc."},{"key":"10.1016\/0196-6774(89)90025-4_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01840353","article-title":"Global wire routing in two-dimensional arrays","volume":"2","author":"Karp","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0196-6774(89)90025-4_BIB9","unstructured":"M. R. Kramer and J. van Leeuwen, \u201cWire-Routing Is NP-Complete,\u201d Technical Report RUU-CS-84-4, University of Utrecht."},{"key":"10.1016\/0196-6774(89)90025-4_BIB10","series-title":"Proceedings, 25th FOCS","first-page":"127","article-title":"Parallel communication with limited buffers","author":"Pippenger","year":"1984"},{"key":"10.1016\/0196-6774(89)90025-4_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","article-title":"The complexity of restricted spanning tree problems","volume":"29","author":"Papadimitriou","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0196-6774(89)90025-4_BIB12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0196-6774(86)90006-4","article-title":"Single bend wiring","volume":"7","author":"Raghavan","year":"1986","journal-title":"J. Algorithms"},{"issue":"No. 3","key":"10.1016\/0196-6774(89)90025-4_BIB13","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/TC.1984.1676428","article-title":"Complexity of single-layer routing","volume":"33","author":"Richards","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(89)90025-4_BIB14","first-page":"237","article-title":"Overview of the CHiP computer","author":"Snyder","year":"1981"},{"issue":"No. 3","key":"10.1016\/0196-6774(89)90025-4_BIB15","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1145\/828.1892","article-title":"Efficient schemes for parallel communication","volume":"31","author":"Upfal","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(89)90025-4_BIB16","series-title":"Proceedings, 13th STOC","first-page":"263","article-title":"Universal schemes for parallel computation","author":"Valiant","year":"1981"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900254?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677489900254?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:54:50Z","timestamp":1548744890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677489900254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0196677489900254"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(89)90025-4","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}