{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:25Z","timestamp":1725474985410},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_57","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"567-577","source":"Crossref","is-referenced-by-count":3,"title":["Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering 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":"57_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)"},{"key":"57_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Computing and Combinatorics","author":"M. Lin","year":"2006","unstructured":"Lin, M., Yang, Y., Xu, J.: On lazy bin covering and packing problems. In: Chen, D.Z., Lee, D.T. (eds.) COCOON 2006. LNCS, vol.\u00a04112, Springer, Heidelberg (2006)"},{"key":"57_CR3","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, 257\u2013298 (1976)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"57_CR4","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\u201328 (1993)","journal-title":"J. Algorithms"},{"key":"57_CR5","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, 115\u2013138 (2001)","journal-title":"Algorithmica"},{"key":"57_CR6","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, 65\u2013106 (1985)","journal-title":"J. Complexity"},{"key":"57_CR7","doi-asserted-by":"publisher","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\u00a049, 329\u2013338 (1993)","journal-title":"Computing"},{"key":"57_CR8","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, 575\u2013581 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"57_CR9","doi-asserted-by":"publisher","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\u00a029, 442\u2013467 (2001)","journal-title":"Algorithmica"},{"key":"57_CR10","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, 61\u201379 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"57_CR11","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. In: SODA 2004, pp. 224\u2013233 (2004)"},{"key":"57_CR12","unstructured":"Csirik, J., Kenyon, C., Johnson, D.S.: Better approximation algorithms for bin covering. In: SODA, pp. 557\u2013566 (2001)"},{"key":"57_CR13","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, 502\u2013525 (1984)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:50:03Z","timestamp":1619495403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11940128_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}