{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:40:01Z","timestamp":1748461201817,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_7","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"78-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs"],"prefix":"10.1007","author":[{"given":"Noa","family":"Avigdor-Elgrabli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungjin","family":"Im","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Rabani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Czumaj, A., Englert, M., R\u00e4cke, H.: Almost tight bounds for reordering buffer management. In: STOC, pp. 607\u2013616 (2011)","DOI":"10.1145\/1993636.1993717"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Adamaszek, A., Czumaj, A., Englert, M., R\u00e4cke, H.: Optimal online buffer scheduling for block devices. In: STOC, pp. 589\u2013598 (2012)","DOI":"10.1145\/2213977.2214031"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Rabani, Y.: An improved competitive algorithm for reordering buffer management. In: SODA, pp. 13\u201321 (2010)","DOI":"10.1137\/1.9781611973075.2"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Rabani, Y. : An improved competitive algorithm for reordering buffer management. In: FOCS, pp. 1\u201310 (2013)","DOI":"10.1137\/1.9781611973105.70"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Rabani, Y.: An optimal randomized online algorithm for reordering buffer management (2013). CoRR, 1303.3386","DOI":"10.1137\/1.9781611973105.70"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Blandford, D., Blelloch, G.: Index compression through document reordering. In: Proceedings of the Data Compression Conference, DCC 2002, pp. 342-. IEEE Computer Society, Washington, DC (2002)","DOI":"10.1109\/DCC.2002.999972"},{"issue":"2\u20133","key":"7_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1561\/0400000024","volume":"3","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science 3(2\u20133), 93\u2013263 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.tcs.2011.12.077","volume":"423","author":"H-L Chan","year":"2012","unstructured":"Chan, H.-L., Megow, N., Sitters, R., van Stee, R.: A note on sorting buffers offline. Theor. Comput. Sci. 423, 11\u201318 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"7_CR9","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 of Computing 6(1), 27\u201346 (2010)","journal-title":"Theory of Computing"},{"key":"7_CR10","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)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Gamzu, I., Segev, D.: Improved online algorithms for the sorting buffer problem on line metrics. ACM Transactions on Algorithms 6(1) (2009)","DOI":"10.1145\/1644015.1644030"},{"issue":"9","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1865","DOI":"10.1080\/00207540310001646821","volume":"42","author":"K Gutenschwager","year":"2004","unstructured":"Gutenschwager, K., Spiekermann, S., Vos, S.: A sequential ordering problem in automotive paint shops. Intl. J. of Production Research 42(9), 1865\u20131878 (2004)","journal-title":"Intl. J. of Production Research"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Im, S., Moseley, B.: New approximations for reordering buffer management. In: SODA, pp. 1093\u20131111 (2014)","DOI":"10.1137\/1.9781611973402.81"},{"key":"7_CR14","unstructured":"Krokowski, Jens, R\u00e4cke, Harald, Sohler, Christian, Westermann, Matthias: Reducing state changes with a pipeline buffer. In: VMV, p. 217 (2004)"},{"key":"7_CR15","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 - 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.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 820\u2013832. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:42Z","timestamp":1748459382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}