{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:29:29Z","timestamp":1726522169901},"reference-count":44,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":5586,"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,4]]},"DOI":"10.1016\/s0304-3975(97)00198-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"131-151","source":"Crossref","is-referenced-by-count":14,"title":["Efficient delay routing"],"prefix":"10.1016","volume":"196","author":[{"given":"Miriam","family":"Di Ianni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00198-9_BIB1","series-title":"Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)","first-page":"60","article-title":"Randomized parallel communication","author":"Aleliunas","year":"1982"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB2","series-title":"Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"412","article-title":"Efficient routing and scheduling algorithms for optical networks","author":"Aggarwal","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB3","series-title":"Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"567","article-title":"Improved bounds for all optical routing","author":"Aumann","year":"1995"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB4","series-title":"Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"312","article-title":"Competitive non-preemptive call control","author":"Awerbuch","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB5","series-title":"Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"412","article-title":"On-line admission control and circuit routing for high performance computing and communication","author":"Awerbuch","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB6","series-title":"Proc. 12th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)","first-page":"75","article-title":"Fast deflection routing for packets and worms","author":"Bar-Noy","year":"1993"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB7","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/rsa.3240020402","article-title":"An algorithmic approach to the Lov\u00e1sz Local Lemma I","volume":"2","author":"Beck","year":"1991","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB8","series-title":"Proc. of the 4th Workshop on Distributed Algorithms (WDAG)","article-title":"Greedy packet scheduling","author":"Cidon","year":"1990"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB9","series-title":"Proc. IEEE Conf. on Computer Communications (INFOCOM)","first-page":"1336","article-title":"Optimum schedule problems in store-and-forward networks","author":"Clementi","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB10","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/90.491013","article-title":"On the hardness of approximating optimum schedule problems in Store-and-Forward networks","volume":"4","author":"Clementi","year":"1996","journal-title":"IEEE-ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB11","series-title":"Proc. 28th ACM Symp. on Theory of Computing (STOC)","article-title":"Universal algorithms for store-and-forward and wormhole routing","author":"Cypher","year":"1996"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB12","series-title":"Proc. of EuroPar '96 Parallel Processing","first-page":"258","article-title":"Efficient delay routing","volume":"vol. 1123","author":"Di Ianni","year":"1996"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB13","series-title":"Proc. of the IEEE Conf. on Computational Complexity","article-title":"Zero knowledge and the chromatic number","author":"Feige","year":"1996"},{"article-title":"Competitive analysis of call admission algorithms that allow delay","year":"1995","author":"Feldmann","key":"10.1016\/S0304-3975(97)00198-9_BIB14"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB15","series-title":"Proc. 33rd IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"563","article-title":"A theory of wormhole routing in parallel computers","author":"Felperin","year":"1992"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB16","series-title":"Proc. 2nd Ann. Israel Conf. on Theory of Computing and Systems","first-page":"285","article-title":"Efficient on-line call control algorithms","author":"Garay","year":"1993"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0304-3975(97)00198-9_BIB17"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB18","series-title":"Proc. of the 37th IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"627","article-title":"Clique is hard to approximate within n1 \u2212 \u03b5","author":"Hastad","year":"1996"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB19","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00198-9_BIB20","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB21","series-title":"Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"394","article-title":"Beyond competitive analysis (on-line algorithms)","author":"Koutsoupias","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB22","first-page":"411","article-title":"Optimal routing algorithms for mesh-connected processor array","volume":"vol. 319","author":"Krizanc","year":"1988"},{"year":"1992","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","key":"10.1016\/S0304-3975(97)00198-9_BIB23"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB24","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/12.142684","article-title":"Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks","volume":"41","author":"Leighton","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00198-9_BIB25_1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","article-title":"Packet routing and jobshop scheduling in O(congestion + dilation) steps","volume":"14","author":"Leighton","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB25_2","series-title":"Proc. 29th IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"256","article-title":"A preliminary version of this paper appeared as \u201cUniversal packet routing algorithms\u201d","author":"Leighton","year":"1988"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB26","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1994.1030","article-title":"Randomized routing and sorting on fixed-connection networks","volume":"17","author":"Leighton","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01215349","article-title":"Packet routing and job-shop scheduling in O(congestion + dilation) steps","volume":"2","author":"Leighton","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB28","doi-asserted-by":"crossref","DOI":"10.21236\/ADA311323","article-title":"Fast algorithms for finding O(congestion + dilation) packet routing schedules","author":"Leighton","year":"1996"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB29","series-title":"Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures (SPAA)","article-title":"A 2N \u2212 2 step algorithm for routing in an N \u00d7 N mesh","author":"Leighton","year":"1989"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01762110","article-title":"Communication-efficient parallel graph algorithms for distributed randomaccess machines","volume":"3","author":"Leiserson","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB31","series-title":"Proc. ACM SIGACT-SIGOPS Principles of Distributed Computing '91 (PODC)","first-page":"165","article-title":"Greedy packet scheduling on shortest paths","author":"Mansour","year":"1991"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB32","series-title":"Proc. of the 12th Symp. on Theoretical Aspects of Computer Sience (STACS)","first-page":"291","article-title":"A packet routing protocol for arbitrary networks","author":"der Heide","year":"1995"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB33","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/2.191995","article-title":"A survey of wormhole routing techniques in direct networks","volume":"26","author":"Ni","year":"1993","journal-title":"IEEE Comput."},{"key":"10.1016\/S0304-3975(97)00198-9_BIB34","series-title":"Proc. 29th Ann. ACM Symp. on Theory of Computing (STOC)","first-page":"644","article-title":"Universal O(congestion + dilation + log1+N) local control packet switching algorithms","author":"Ostrovsky","year":"1997"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB35","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00198-9_BIB36","series-title":"Proc. 25th IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"127","article-title":"Parallel communication with limited buffers","author":"Pippenger","year":"1984"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB37","series-title":"Proc. 26th Ann. ACM Symp. on Theory of Computing (STOC)","first-page":"133","article-title":"Efficient routing in all-optical networks","author":"Raghawan","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB38","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","article-title":"How to emulate shared memory","volume":"42","author":"Ranade","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00198-9_BIB39","series-title":"Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science (FOCS)","first-page":"347","article-title":"Nearly tight bounds for wormhole routing","author":"Ranade","year":"1994"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB40","series-title":"Proc. 29th Ann. ACM Symp. on Theory of Computing (STOC)","first-page":"636","article-title":"A constant factor approximation algorithm for packet routing, and balancing local vs. global criteria","author":"Srinivasan","year":"1997"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB41","series-title":"Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC)","first-page":"55","article-title":"Efficient schemes for parallel communication","author":"Upfal","year":"1982"},{"key":"10.1016\/S0304-3975(97)00198-9_BIB42","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","article-title":"A scheme for fast parallel communication","volume":"11\/2","author":"Valiant","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00198-9_BIB43","series-title":"Proc. 13th ACM Symp. on Theory of Computing","first-page":"263","article-title":"Universal schemes for parallel communication","author":"Valiant","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001989?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001989?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:26:28Z","timestamp":1556508388000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0304397597001989"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00198-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}