{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:22Z","timestamp":1725574102900},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_14","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"153-164","source":"Crossref","is-referenced-by-count":1,"title":["Effective Routing and Scheduling in Adversarial Queueing Networks"],"prefix":"10.1007","author":[{"given":"Jay","family":"Sethuraman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Piaw","family":"Teo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1006\/jcss.1999.1681","volume":"60","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosen, A.: Adaptive Packet Routing for Bursty Adversarial Traffic. Journal of Computer and System Sciences\u00a060, 482\u2013509 (2000); Preliminary version in Proceedings of the 30th STOC, pp. 359\u2013368 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Andrews, M., Awerbuch, B., Fernandez, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal-stability results for greedy contention-resolution protocols. In: Proceedings of the 37th FOCS, pp. 380\u2013389 (1996)","DOI":"10.1109\/SFCS.1996.548497"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M. Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fernandez, A., Leighton, F.T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contention resolution protocols. Journal of the ACM\u00a048(1), 39\u201369 (2001)","journal-title":"Journal of the ACM"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Andrews, M., Fernandez, A., Goel, A., Zhang, L.: Source Routing and Scheduling in Packet Networks. In: Proceedings of the 42nd FOCS, pp. 168\u2013177 (2001)","DOI":"10.1109\/SFCS.2001.959891"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Berenbrink, P., Brinkmann, A., Scheideler, C.: Simple Routing Strategies for Adversarial Systems. In: Proceedings of the 42nd FOCS, pp. 158\u2013167 (2001)","DOI":"10.1109\/SFCS.2001.959890"},{"key":"14_CR7","unstructured":"Belov, I.S., Stolin, Y.N.: An algorithm in a single path operations scheduling problem. Mathematical Economics and Functional Analysis, 248\u2013257 (1974) (in Russian)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s101070100272","volume":"92","author":"D. Bertsimas","year":"2002","unstructured":"Bertsimas, D., Sethuraman, J.: From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective. Mathematical Programming\u00a092(1), 61\u2013102 (2002)","journal-title":"Mathematical Programming"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A. Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial Queueing Theory. Journal of the ACM\u00a048(1), 13\u201338 (2001); Preliminary version in Proceedings of the 28th STOC, 376\u2013385 (1996)","journal-title":"Journal of the ACM"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/18.61110","volume":"37","author":"R. Cruz","year":"1991","unstructured":"Cruz, R.: A Calculus for network delay, part II: network analysis. IEEE Transactions on Information Theory\u00a037, 132\u2013141 (1991)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR11","first-page":"389","volume":"3","author":"T. Fiala","year":"1977","unstructured":"Fiala, T.: Kozel\u00edto algorithmus a h\u00e1rom g\u00e9p probl\u00e9m\u00e1ra. Alkalmazott Matematikai Lapok\u00a03, 389\u2013398 (1977)","journal-title":"Alkalmazott Matematikai Lapok"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gamarnik, D.: Stability of Adaptive and Non-Adaptive Packet Routing Policies in Adversarial Queueing Networks. In: Proceedings of 31st STOC (1999)","DOI":"10.1145\/301250.301306"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01840353","volume":"2","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global Wire Routing in Two-Dimensional Arrays. Algorithmica\u00a02, 113\u2013129 (1987)","journal-title":"Algorithmica"},{"key":"#cr-split#-14_CR14.1","unstructured":"Sevastyanov, S.V.: On an asymptotic approach to some problems in scheduling theory. In: Abstracts of papers at 3                    rd                   All-Union Conference of Problems of Theoretical Cybernetics, Novosibirsk, pp. 67\u201369 (1974);"},{"key":"#cr-split#-14_CR14.2","unstructured":"Inst. Mat. Sibirsk. Otdel. Akad. Nauk SSSR"},{"issue":"3","key":"14_CR15","first-page":"447","volume":"29","author":"S.V. Sevastyanov","year":"1984","unstructured":"Sevastyanov, S.V.: Efficient construction of schedules close to optimal for the cases of arbitrary and alternative routes of parts. Soviet Math. Dokl.\u00a029(3), 447\u2013450 (1984)","journal-title":"Soviet Math. Dokl."},{"issue":"6","key":"14_CR16","first-page":"74","volume":"22","author":"S.V. Sevastyanov","year":"1986","unstructured":"Sevastyanov, S.V.: Bounding algorithm for the routing problem with arbitrary paths and alternative servers. Kibernetika\u00a022(6), 74\u201379 (1986); Translation in Cybernetics 22, 773\u2013780","journal-title":"Kibernetika"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(94)90036-1","volume":"55","author":"S.V. Sevastyanov","year":"1994","unstructured":"Sevastyanov, S.V.: On some geometric methods in scheduling theory: a survey. Discrete Applied Mathematics\u00a055, 59\u201382 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:08:40Z","timestamp":1553353720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}