{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:50Z","timestamp":1725544610367},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_48","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"584-595","source":"Crossref","is-referenced-by-count":13,"title":["Online Sorting Buffers on Line"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Khandekar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinayaka","family":"Pandit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"48_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00453-001-0071-1","volume":"32","author":"M. Andrews","year":"2002","unstructured":"Andrews, M., Bender, M., Zhang, L.: New algorithms for disc scheduling. Algorithmica\u00a032(2), 277\u2013301 (2002)","journal-title":"Algorithmica"},{"key":"48_CR2","unstructured":"Bar-Yehuda, R., Laserson, J.: 9-approximation algorithm for the sorting buffers problem. In: 3rd Workshop on Approximation and Online Algorithms (2005)"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: IEEE Symposium on Foundations of Computer Science, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1137\/S0097539701392056","volume":"31","author":"M. Charikar","year":"2001","unstructured":"Charikar, M., Khuller, S., Raghavachari, B.: Algorithms for capacitated vehicle routing. SIAM Journal of Computing\u00a031, 665\u2013682 (2001)","journal-title":"SIAM Journal of Computing"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Raghavachari, B.: The finite capacity dial-a-ride problem. In: IEEE Symposium on Foundations of Computer Science, pp. 458\u2013467 (1998)","DOI":"10.1109\/SFCS.1998.743496"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Englert, M., Westermann, M.: Reordering buffer management for non-uniform cost models. In: Proceedings of the 32nd International Colloquium on Algorithms, Langauages, and Programming, pp. 627\u2013638 (2005)","DOI":"10.1007\/11523468_51"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: 35th Annual ACM Symposium on Theory of Computing, pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"key":"48_CR8","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":"J. Kohrt","year":"2004","unstructured":"Kohrt, J., Pruhs, K.: A constant approximation algorithm for sorting buffers. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 193\u2013202. Springer, Heidelberg (2004)"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: Proceedings of the European Symposium on Algorithms, pp. 820\u2013832 (2002)","DOI":"10.1007\/3-540-45749-6_71"},{"key":"48_CR10","first-page":"435","volume-title":"Applied Operating System Concepts, ch. 13","author":"A. Silberschatz","year":"2000","unstructured":"Silberschatz, A., Galvin, P., Gagne, G.: Applied Operating System Concepts, ch. 13, 1st edn., pp. 435\u2013468. John Wiley and Sons, Chichester (2000)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:31:30Z","timestamp":1555471890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11672142_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}