{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T22:10:05Z","timestamp":1748815805708,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_35","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"469-482","source":"Crossref","is-referenced-by-count":6,"title":["Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"5","key":"35_CR1","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10951-009-0116-x","volume":"12","author":"EI Asgeirsson","year":"2009","unstructured":"Asgeirsson, E.I., Stein, C.: Bounded-space online bin cover. J. Sched. 12(5), 461\u2013474 (2009)","journal-title":"J. Sched."},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"SF Assmann","year":"1984","unstructured":"Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the one-dimensional bin packing problem. J. Algorithms 5(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2014.06.029","volume":"556","author":"MG Christ","year":"2014","unstructured":"Christ, M.G., Favrholdt, L.M., Larsen, K.S.: Online bin covering: expectations vs. guarantees. Theor. Comput. Sci. 556, 71\u201384 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"35_CR4","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0269964800001753","volume":"4","author":"C Courcoubetis","year":"1990","unstructured":"Courcoubetis, C., Weber, R.R.: Stability of on-line bin packing with random arrivals and long-run average constraints. Probab. Eng. Informational Sci. 4(4), 447\u2013460 (1990)","journal-title":"Probab. Eng. Informational Sci."},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0196-6774(91)90001-F","volume":"12","author":"J Csirik","year":"1991","unstructured":"Csirik, J., Frenk, J.B.G., Galambos, G., Kan, A.H.G.R.: Probabilistic analysis of algorithms for dual bin packing problems. J. Algorithms 12(2), 189\u2013203 (1991)","journal-title":"J. Algorithms"},{"key":"35_CR6","unstructured":"Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 557\u2013566 (2001)"},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(88)90052-2","volume":"21","author":"J Csirik","year":"1988","unstructured":"Csirik, J., Totik, V.: Online algorithms for a dual version of bin packing. Discrete Appl. Math. 21(2), 163\u2013167 (1988)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"35_CR8","doi-asserted-by":"publisher","first-page":"2810","DOI":"10.1016\/j.dam.2007.11.004","volume":"156","author":"EG Coffman Jr","year":"2008","unstructured":"Coffman Jr., E.G., Csirik, J., R\u00f3nyai, L., Zsb\u00e1n, A.: Random-order bin packing. Discrete Appl. Math. 156(6), 2810\u20132816 (2008)","journal-title":"Discrete Appl. Math."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, C., R\u00f6glin, H.: Probabilistic analysis of the dual next-fit algorithm for bin covering, December 2015. http:\/\/arxiv.org\/abs\/1512.04719","DOI":"10.1007\/978-3-662-49529-2_35"},{"issue":"1\u20133","key":"35_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S0304-3975(03)00363-3","volume":"306","author":"K Jansen","year":"2003","unstructured":"Jansen, K., Solis-Oba, R.: An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306(1\u20133), 543\u2013551 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"14","key":"35_CR11","doi-asserted-by":"publisher","first-page":"2810","DOI":"10.1016\/j.dam.2007.11.004","volume":"156","author":"EG Coffman Jr","year":"2008","unstructured":"Coffman Jr., E.G., Csirik, J., R\u00f3nyai, L., Zsb\u00e1n, A.: Random-order bin packing. Discrete Appl. Math. 156(14), 2810\u20132816 (2008)","journal-title":"Discrete Appl. Math."},{"key":"35_CR12","unstructured":"Kenyon, C.: Best-fit bin-packing with random order. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 359\u2013364 (1996)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS (2009)","DOI":"10.1090\/mbk\/058"},{"issue":"2","key":"35_CR14","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1214\/aoms\/1177697092","volume":"41","author":"G Lorden","year":"1970","unstructured":"Lorden, G.: On excess over the boundary. Ann. Math. Stat. 41(2), 520\u2013527 (1970)","journal-title":"Ann. Math. Stat."},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00453-007-9073-y","volume":"50","author":"N Naaman","year":"2008","unstructured":"Naaman, N., Rom, R.: Average case analysis of bounded space bin packing algorithms. Algorithmica 50, 72\u201397 (2008)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T21:29:23Z","timestamp":1748813363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}