{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:20:52Z","timestamp":1778595652979,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030013240","type":"print"},{"value":"9783030013257","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01325-7_22","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T13:43:05Z","timestamp":1540906985000},"page":"237-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Online Service with Delay on a Line"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Kraska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"22_CR1","unstructured":"Aboud, A.: Correlation clustering with penalties and approximating the reordering buffer management problem. Master\u2019s thesis, Computer Science Department, The Technion Israel Institute of Technology (2008)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Czumaj, A., Englert, M., R\u00e4cke, H.: Almost tight bounds for reordering buffer management. In: Proceedings 43rd ACM Symposium on Theory of Computing (STOC), pp. 607\u2013616 (2011)","DOI":"10.1145\/1993636.1993717"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-662-47672-7_7","volume-title":"Automata, Languages, and Programming","author":"Noa Avigdor-Elgrabli","year":"2015","unstructured":"Avigdor-Elgrabli, N., Im, S., Moseley, B., Rabani, Y.: On the randomized competitive ratio of reordering buffer management with non-uniform costs. In: Proceedings 42nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 78\u201390 (2015)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/1.9781611973075.2","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Noa Avigdor-Elgrabli","year":"2010","unstructured":"Avigdor-Elgrabli, N., Rabani, Y.: An improved competitive algorithm for reordering buffer management. In: Proceedings 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 13\u201321 (2010)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Rabani, Y.: An optimal randomized online algorithm for reordering buffer management. In: Proceedings 54th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1\u201310 (2013)","DOI":"10.1109\/FOCS.2013.9"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Ganesh, A., Ge, R., Panigrahi, D.: Online service with delay. In: Proceedings 49th ACM Symposium on Theory of Computing (STOC), pp. 551\u2013563 (2017)","DOI":"10.1145\/3055399.3055475"},{"issue":"5","key":"22_CR7","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/2783434","volume":"62","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Buchbinder, N., M\u0105dry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. J. ACM 62(5), 40:1\u201340:49 (2015)","journal-title":"J. ACM"},{"key":"22_CR8","unstructured":"Bienkowski, M., et al.: Online algorithms for multi-level aggregation. In: Proceedings 24th European Symposium on Algorithms (ESA), pp. 12:1\u201312:17 (2016)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2017.10.008","volume":"707","author":"M Bienkowski","year":"2018","unstructured":"Bienkowski, M., et al.: Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707, 89\u201393 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR10","first-page":"42","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Marcin Bienkowski","year":"2013","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, L., Nogneng, D., Sgall, J.: Better approximation bounds for the joint replenishment problem. In: Proceedings 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 42\u201354 (2014)"},{"key":"22_CR11","first-page":"133","volume-title":"Lecture Notes in Computer Science","author":"Marcin Bienkowski","year":"2013","unstructured":"Bienkowski, M., Byrka, J., Chrobak, M., Je\u017c, \u0141., Sgall, J., Stachowiak, G.: Online control message aggregation in chain networks. In: Proceedings 13th International Workshop on Algorithms and Data Structures (WADS), pp. 133\u2013145 (2013)"},{"key":"22_CR12","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)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s00453-011-9567-5","volume":"64","author":"C Brito","year":"2012","unstructured":"Brito, C., Koutsoupias, E., Vaya, S.: Competitive analysis of organization networks or multicast acknowledgement: how much to wait? Algorithmica 64(4), 584\u2013605 (2012)","journal-title":"Algorithmica"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Talmon, O.: O(depth)-competitive algorithm for online multi-level aggregation. In: Proceedings 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1235\u20131244 (2017)","DOI":"10.1137\/1.9781611974782.80"},{"key":"22_CR15","unstructured":"Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K., Sviridenko, M.: Online make-to-order joint replenishment model: primal dual competitive algorithms. In: Proceedings 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 952\u2013961 (2008)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Englert, M., R\u00e4cke, H.: Reordering buffers with logarithmic diameter dependency for trees. In: Proceedings 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1224\u20131234 (2017)","DOI":"10.1137\/1.9781611974782.79"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"27","DOI":"10.4086\/toc.2010.v006a002","volume":"6","author":"M Englert","year":"2010","unstructured":"Englert, M., R\u00e4cke, H., Westermann, M.: Reordering buffers for general metric spaces. Theory Comput. Syst. 6(1), 27\u201346 (2010)","journal-title":"Theory Comput. Syst."},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/11523468_51","volume-title":"Automata, Languages and Programming","author":"M Englert","year":"2005","unstructured":"Englert, M., Westermann, M.: Reordering buffer management for non-uniform cost models. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 627\u2013638. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_51"},{"issue":"3","key":"22_CR19","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"22_CR20","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/1644015.1644030","volume":"6","author":"I Gamzu","year":"2009","unstructured":"Gamzu, I., Segev, D.: Improved online algorithms for the sorting buffer problem on line metrics. ACM Trans. Algorithms 6(1), 15:1\u201315:14 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"22_CR21","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.jda.2008.08.002","volume":"8","author":"R Khandekar","year":"2010","unstructured":"Khandekar, R., Pandit, V.: Online and offline algorithms for the sorting buffers problem on the line metric. J. Discret. Algorithms 8(1), 24\u201335 (2010)","journal-title":"J. Discret. Algorithms"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/3-540-45749-6_71","volume-title":"Algorithms \u2014 ESA 2002","author":"H R\u00e4cke","year":"2002","unstructured":"R\u00e4cke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 820\u2013832. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_71"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01325-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T18:30:36Z","timestamp":1572373836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01325-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030013240","9783030013257"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01325-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ma'ale HaHamisha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/sirocco2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1.97","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}