{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T08:26:46Z","timestamp":1649060806622},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0377-2217(99)00455-5","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"249-256","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of permutation routing algorithms"],"prefix":"10.1016","volume":"125","author":[{"given":"J\u00f3zsef","family":"B\u00e9k\u00e9si","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Galambos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P\u00e9ter","family":"Hajnal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0377-2217(99)00455-5_BIB1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/12.73589","article-title":"Square meshes are not always optimal","volume":"40","author":"Bar-Noy","year":"1991","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(93)90208-Q","article-title":"A lower bound for permutation routing on two-dimensional bused meshes","volume":"45","author":"Cheung","year":"1993","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(92)90019-R","article-title":"Mesh permutation routing with locality","volume":"43","author":"Cheung","year":"1992","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/PL00009164","article-title":"Routing on meshes with buses","volume":"18","author":"Kaufmann","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01294128","article-title":"A 2n\u22122 step algorithm for routing in an n\u00d7n array with constant size queues","volume":"14","author":"Leighton","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB6","doi-asserted-by":"crossref","unstructured":"T. Leighton, Average-case analysis of greedy routing algorithms, in: Proceedings of the Second ACM Symposium on Parallel Algorithms and Architectures, 1990, pp. 2\u20138","DOI":"10.1145\/97444.97448"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB7","doi-asserted-by":"crossref","unstructured":"J.Y.T. Leung, S.M. Shende, Packet routing on square meshes with row and column buses, in: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991, pp. 834\u2013837","DOI":"10.1109\/SPDP.1991.218234"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB8","unstructured":"J.Y.T. Leung, S.M. Shende, On multi-dimensional packet routing for meshes with buses, Technical Report TR-150, Department of Computer Science and Engineering, University of Nebraska at Lincoln, 1992"},{"key":"10.1016\/S0377-2217(99)00455-5_BIB9","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:26:13Z","timestamp":1556274373000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0377221799004555"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00455-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}