{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T20:31:28Z","timestamp":1768249888030,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T00:00:00Z","timestamp":1213142400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s00453-008-9202-2","type":"journal-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T17:10:17Z","timestamp":1213117817000},"page":"232-251","source":"Crossref","is-referenced-by-count":7,"title":["Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems"],"prefix":"10.1007","volume":"57","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","published-online":{"date-parts":[[2008,6,11]]},"reference":[{"issue":"4","key":"9202_CR1","doi-asserted-by":"crossref","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.\u00a0Algorithms 5(4), 502\u2013525 (1984)","journal-title":"J.\u00a0Algorithms"},{"key":"9202_CR2","first-page":"224","volume-title":"SODA\u201904: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"A. Bar-Noy","year":"2004","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. In: SODA\u201904: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.\u00a0224\u2013233. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"issue":"1\u20133","key":"9202_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.tcs.2006.06.001","volume":"362","author":"J. Boyar","year":"2006","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. Theor. Comput. Sc. 362(1\u20133), 127\u2013139 (2006)","journal-title":"Theor. Comput. Sc."},{"key":"9202_CR4","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1997","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Approximation Algorithms for NP-Hard Problems, pp.\u00a046\u201393. PWS, Boston (1997)"},{"issue":"1","key":"9202_CR5","doi-asserted-by":"crossref","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.\u00a0Algorithms 15(1), 1\u201328 (1993)","journal-title":"J.\u00a0Algorithms"},{"issue":"2","key":"9202_CR6","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 31(2), 115\u2013138 (2001)","journal-title":"Algorithmica"},{"key":"9202_CR7","unstructured":"Csirik, J., Kenyon, C., Johnson, D.S.: Better approximation algorithms for bin covering. In: SODA, pp.\u00a0557\u2013566 (2001)"},{"key":"9202_CR8","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/103418.103446","volume-title":"STOC \u201991: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing","author":"E.G. Coffman Jr.","year":"1991","unstructured":"Coffman, E.G. Jr., Courcoubetis, C., Garey, M.R., Johnson, D.S., McGeoch, L.A., Shor, P.W., Weber, R.R., Yannakakis, M.: Fundamental discrepancies between average-case analysis under discrete and continuous distributions: a bin packing case study. In: STOC \u201991: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp.\u00a0230\u2013240. Assoc. Comput. Math., New York (1991)"},{"issue":"1","key":"9202_CR9","doi-asserted-by":"crossref","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. 4(1), 61\u201379 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"9202_CR10","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02248693","volume":"49","author":"G. Galambos","year":"1993","unstructured":"Galambos, G., Woeginger, G.: Repacking helps in bounded space on-line bin-packing. Computing 49, 329\u2013338 (1993)","journal-title":"Computing"},{"issue":"3","key":"9202_CR11","doi-asserted-by":"crossref","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.\u00a0Comb. Theory, Ser. A 21(3), 257\u2013298 (1976)","journal-title":"J.\u00a0Comb. Theory, Ser. A"},{"issue":"1","key":"9202_CR12","doi-asserted-by":"crossref","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.\u00a0Complex. 1(1), 65\u2013106 (1985)","journal-title":"J.\u00a0Complex."},{"key":"9202_CR13","doi-asserted-by":"crossref","unstructured":"Lin, M., Yang, Y., Xu, J.: On lazy bin covering and packing problems. In: COCOON, pp.\u00a0340\u2013349 (2006)","DOI":"10.1007\/11809678_36"},{"issue":"3","key":"9202_CR14","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/s004530010057","volume":"29","author":"H. Shachnai","year":"2001","unstructured":"Shachnai, H., Tamir, T.: On two class-constrained versions of the multiple knapsack problem. Algorithmica 29(3), 442\u2013467 (2001)","journal-title":"Algorithmica"},{"key":"9202_CR15","doi-asserted-by":"crossref","unstructured":"Shachnai, H., Tamir, T., Yehezkely, O.: Approximation schemes for packing with item fragmentation. In: Proc. of WAOA\u201905 (2005)","DOI":"10.1007\/11671411_26"},{"issue":"4","key":"9202_CR16","doi-asserted-by":"crossref","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. 6(4), 575\u2013581 (1993)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9202-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9202-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9202-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:02Z","timestamp":1559137502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9202-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9202"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9202-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,11]]}}}