{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:19Z","timestamp":1759638919186,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319182629"},{"type":"electronic","value":"9783319182636"}],"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-319-18263-6_3","type":"book-chapter","created":{"date-parts":[[2015,4,22]],"date-time":"2015-04-22T14:41:38Z","timestamp":1429713698000},"page":"23-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Better Algorithms for Online Bin Stretching"],"prefix":"10.1007","author":[{"given":"Martin","family":"B\u00f6hm","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[]},{"given":"Rob","family":"van Stee","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Vesel\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. J. ACM 44, 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-49543-6_7","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Y Azar","year":"1998","unstructured":"Azar, Y., Regev, O.: On-line bin-stretching. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 71\u201381. Springer, Heidelberg (1998)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jagm.1999.1070","volume":"35","author":"P Berman","year":"2000","unstructured":"Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms 35, 108\u2013121 (2000)","journal-title":"J. Algorithms"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-1-4419-7997-1_35","volume-title":"Handbook of Combinatorial Optimization","author":"E Coffman Jr","year":"2013","unstructured":"Coffman Jr, E., Csirik, J., Galambos, G., Martello, S., Vigo, D.: Bin packing approximation algorithms: survey and classification. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 455\u2013531. Springer, New York (2013)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s00453-008-9235-6","volume":"53","author":"T Ebenlendr","year":"2009","unstructured":"Ebenlendr, T., Jawor, W., Sgall, J.: Preemptive online scheduling: optimal algorithms for all speeds. Algorithmica 53, 504\u2013522 (2009)","journal-title":"Algorithmica"},{"key":"3_CR6","unstructured":"Gabay, M., Brauner, N., Kotov, V.: Computing lower bounds for semi-online optimization problems: application to the bin stretching problem. HAL preprint hal-00921663 (2013)"},{"key":"3_CR7","unstructured":"Gabay, M., Kotov, V., Brauner, N.: Semi-online bin stretching with bunch techniques. HAL preprint hal-00869858 (2013)"},{"key":"3_CR8","unstructured":"Johnson, D.: Near-optimal Bin Packing Algorithms. Massachusetts Institute of Technology, project MAC. Massachusetts Institute of Technology (1973)"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.orl.2013.03.005","volume":"41","author":"H Kellerer","year":"2013","unstructured":"Kellerer, H., Kotov, V.: An efficient algorithm for bin stretching. Oper. Res. Lett. 41(4), 343\u2013346 (2013)","journal-title":"Oper. Res. Lett."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21, 235\u2013242 (1997)","journal-title":"Oper. Res. Lett."},{"key":"3_CR11","unstructured":"Ullman, J.: The performance of a memory allocation algorithm. Technical report 100 (1971)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18263-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:22:16Z","timestamp":1676938936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18263-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319182629","9783319182636"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18263-6_3","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":"23 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}