{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:54Z","timestamp":1725558954073},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141614"},{"type":"electronic","value":"9783642141621"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14162-1_12","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:21Z","timestamp":1278321981000},"page":"139-150","source":"Crossref","is-referenced-by-count":2,"title":["An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00224-002-1001-6","volume":"35","author":"M. Adler","year":"2002","unstructured":"Adler, M., Rosenberg, A.L., Sitaraman, R.K., Unger, W.: Scheduling time-constrained communication in linear networks. Theory Comput. Syst.\u00a035(6), 599\u2013623 (2002)","journal-title":"Theory Comput. Syst."},{"key":"12_CR2","unstructured":"Aiello, W., Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Dynamic routing on networks with fixed-size buffers. In: SODA, pp. 771\u2013780 (2003)"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00453-007-9143-1","volume":"55","author":"S. Angelov","year":"2009","unstructured":"Angelov, S., Khanna, S., Kunal, K.: The network as a storage device: Dynamic routing with bounded buffers. Algorithmica\u00a055(1), 71\u201394 (2009) (Appeared in APPROX-05)","journal-title":"Algorithmica"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/SFCS.1993.366884","volume-title":"FOCS 1993: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science","author":"B. Awerbuch","year":"1993","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: FOCS 1993: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, pp. 32\u201340. IEEE Computer Society, Washington (1993)"},{"key":"12_CR5","unstructured":"Awerbuch, B., Azar, Y., Fiat, A.: Packet routing via min-cost circuit routing. In: ISTCS, pp. 37\u201342 (1996)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Zachut, R.: Packet routing and information gathering in lines, rings and trees. In: ESA, pp. 484\u2013495 (2005), see also manuscript in http:\/\/www.cs.tau.ac.il\/~azar\/","DOI":"10.1007\/11561071_44"},{"key":"12_CR7","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York (1998)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Naor, J.S.: Improved bounds for online routing and packing via a primal-dual approach. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 293\u2013304 (2006)","DOI":"10.1109\/FOCS.2006.39"},{"issue":"2-3","key":"12_CR9","first-page":"99","volume":"3","author":"N. Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.S.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science\u00a03(2-3), 99\u2013263 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"12_CR10","unstructured":"Even, G., Medina, M.: Online Centralized Deterministic Packet-Routing with Preemptions: A Polylogarithmic Competitive Ratio for Grids (2010) (submitted)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H., Ros\u00e9n, A.: Approximation algorithms for time-constrained scheduling on line networks. In: SPAA, pp. 337\u2013346 (2009)","DOI":"10.1145\/1583991.1584071"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14162-1_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:48:05Z","timestamp":1606186085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14162-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141614","9783642141621"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14162-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}