{"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":1748461201968,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"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_60","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T10:07:39Z","timestamp":1434708459000},"page":"737-748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities"],"prefix":"10.1007","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"60_CR1","unstructured":"Aboud, A.: Correlation clustering with penalties and approximating the reordering buffer management problem. Masters thesis, Computer Science Department, The Technion - Israel Institute of Technology (2008)"},{"key":"60_CR2","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"},{"issue":"2","key":"60_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/jagm.2001.1182","volume":"41","author":"H Alborzi","year":"2001","unstructured":"Alborzi, H., Torng, E., Uthaisombut, P., Wagner, S.: The k-client problem. J. Algorithms 41(2), 115\u2013173 (2001)","journal-title":"J. Algorithms"},{"issue":"10\u201311","key":"60_CR4","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1016\/j.dam.2012.02.005","volume":"160","author":"Y Asahiro","year":"2012","unstructured":"Asahiro, Y., Kawahara, K., Miyano, E.: Np-hardness of the sorting buffer problem on the uniform metric. Discrete Applied Mathematics 160(10\u201311), 1453\u20131464 (2012)","journal-title":"Discrete Applied Mathematics"},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Im, S., Moseley, B., Rabani, Y.: On the randomized competitive ratio of reordering buffer management with non-uniform costs. Manuscript (2014)","DOI":"10.1007\/978-3-662-47672-7_7"},{"key":"60_CR6","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":"60_CR7","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Rabani, Y.: A constant factor approximation algorithm for reordering buffer management. In: SODA (2013)","DOI":"10.1137\/1.9781611973105.70"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Avigdor-Elgrabli, N., Rabani, Y.: An improved competitive algorithm for reordering buffer management. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, October 26\u201329, 2013, Berkeley, CA, USA, pp. 1\u201310 (2013)","DOI":"10.1109\/FOCS.2013.9"},{"issue":"4","key":"60_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.jda.2006.08.001","volume":"5","author":"R Bar-Yehuda","year":"2007","unstructured":"Bar-Yehuda, R., Laserson, J.: Exploiting locality: approximating sorting buffers. J. Discrete Algorithms 5(4), 729\u2013738 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Blandford, D.K., Blelloch, G.E.: Index compression through document reordering. In: DCC, pp. 342\u2013351 (2002)","DOI":"10.1109\/DCC.2002.999972"},{"key":"60_CR11","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, SODA 2000, Philadelphia, PA, USA, pp. 106\u2013115. Society for Industrial and Applied Mathematics (2000)"},{"key":"60_CR12","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."},{"key":"60_CR13","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":"60_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-662-43948-7_39","volume-title":"Automata, Languages, and Programming","author":"H Esfandiari","year":"2014","unstructured":"Esfandiari, H., Hajiaghayi, M.T., Khani, M.R., Liaghat, V., Mahini, H., R\u00e4cke, H.: Online stochastic reordering buffer scheduling. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 465\u2013476. Springer, Heidelberg (2014)"},{"key":"60_CR15","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"},{"key":"60_CR16","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":"60_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/11672142_48","volume-title":"STACS 2006","author":"R Khandekar","year":"2006","unstructured":"Khandekar, R., Pandit, V.: Online sorting buffers on line. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 584\u2013595. Springer, Heidelberg (2006)"},{"key":"60_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-24698-5_23","volume-title":"LATIN 2004: Theoretical Informatics","author":"JS Kohrt","year":"2004","unstructured":"Kohrt, J.S., Pruhs, K.R.: A constant approximation algorithm for sorting buffers. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 193\u2013202. Springer, Heidelberg (2004)"},{"key":"60_CR19","unstructured":"Krokowski, J., R\u00e4cke, H., Sohler, C., Westermann, M.: Reducing state changes with a pipeline buffer. In: VMV, pp. 217 (2004)"},{"key":"60_CR20","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_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:09:49Z","timestamp":1748459389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_60","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"}}]}}