{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:20Z","timestamp":1725543080942},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_36","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"340-349","source":"Crossref","is-referenced-by-count":4,"title":["On Lazy Bin Covering and Packing Problems"],"prefix":"10.1007","author":[{"given":"Mingen","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11537311_35","volume-title":"Fundamentals of Computation Theory","author":"J. Boyar","year":"2005","unstructured":"Boyar, J., Epstein, L., Favrholdt, L.M., Kohrt, J.S., Larsen, K.S., Pedersen, M.M., W\u00f8hlk, S.: The maximum resource bin packing problem. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 397\u2013408. Springer, Heidelberg (2005)"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory, Ser. A\u00a021(3), 257\u2013298 (1976)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"36_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0885-064X(85)90022-6","volume":"1","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S., Garey, M.R.: A 71\/60 theorem for bin packing. J. Complexity\u00a01(1), 65\u2013106 (1985)","journal-title":"J. Complexity"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0404007","volume":"4","author":"D.K. Friesen","year":"1991","unstructured":"Friesen, D.K., Langston, M.A.: Analysis of a compound bin packing algorithm. SIAM J. Discrete Math.\u00a04(1), 61\u201379 (1991)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1028","volume":"15","author":"J. Csirik","year":"1993","unstructured":"Csirik, J.: The parametric behavior of the first-fit decreasing bin packing algorithm. J. Algorithms\u00a015(1), 1\u201328 (1993)","journal-title":"J. Algorithms"},{"issue":"4","key":"36_CR6","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0406045","volume":"6","author":"G.J. Woeginger","year":"1993","unstructured":"Woeginger, G.J.: Improved space for bounded-space, on-line bin-packing. SIAM J. Discrete Math.\u00a06(4), 575\u2013581 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"36_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s00453-001-0041-7","volume":"31","author":"J. Csirik","year":"2001","unstructured":"Csirik, J., Johnson, D.S.: Bounded space on-line bin packing: Best is better than first. Algorithmica\u00a031(2), 115\u2013138 (2001)","journal-title":"Algorithmica"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/11671411_26","volume-title":"Approximation and Online Algorithms","author":"H. Shachnai","year":"2006","unstructured":"Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 334\u2013347. Springer, Heidelberg (2006)"},{"key":"36_CR9","unstructured":"Csirik, J., Kenyon, C., Johnson, D.S.: Better approximation algorithms for bin covering. In: SODA, pp. 557\u2013566 (2001)"},{"issue":"4","key":"36_CR10","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S.F. 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\u00a05(4), 502\u2013525 (1984)","journal-title":"J. Algorithms"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02684336","volume":"60","author":"G. Zhang","year":"1998","unstructured":"Zhang, G.: Parameterized on-line open-end bin packing. Computing\u00a060(3), 267\u2013274 (1998)","journal-title":"Computing"},{"issue":"4","key":"36_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/jos.75","volume":"4","author":"J.Y.T. Leung","year":"2001","unstructured":"Leung, J.Y.T., Dror, M., Young, G.H.: A note on an open-end bin packing problem. Journal of Scheduling\u00a04(4), 201\u2013207 (2001)","journal-title":"Journal of Scheduling"},{"issue":"5","key":"36_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1287\/opre.51.5.759.16753","volume":"51","author":"J. Yang","year":"2003","unstructured":"Yang, J., Leung, J.Y.T.: The ordered open-end bin packing problem. Operations Research\u00a051(5), 759\u2013770 (2003)","journal-title":"Operations Research"},{"issue":"3","key":"36_CR14","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM\u00a032(3), 562\u2013572 (1985)","journal-title":"J. ACM"},{"issue":"4","key":"36_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01(4), 349\u2013355 (1981)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:26:37Z","timestamp":1619493997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11809678_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}