{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:46:47Z","timestamp":1754020007848},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_35","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:00:06Z","timestamp":1127829606000},"page":"397-408","source":"Crossref","is-referenced-by-count":5,"title":["The Maximum Resource Bin Packing Problem"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens S.","family":"Kohrt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten Monrad","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanne","family":"W\u00f8hlk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"35_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0890-5401(03)00060-9","volume":"184","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Bender, M.A., Mitchell, J.S.B., Skiena, S.: The Lazy Bureaucrat scheduling problem. Information and Computation\u00a0184(1), 129\u2013146 (2003)","journal-title":"Information and Computation"},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1016\/0196-6774(84)90004-X","volume":"5","author":"S.F. Assman","year":"1984","unstructured":"Assman, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the onedimensional bin packing problem. J. Alg.\u00a05(4), 502\u2013525 (1984)","journal-title":"J. Alg."},{"key":"35_CR3","first-page":"224","volume-title":"Proc. 12th 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: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 224\u2013233. ACM, New York (2004)"},{"key":"35_CR4","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line algorithms. In: CIAC 2003. LNCS, vol.\u00a02653, pp. 58\u201369. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-44849-7_13"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Boyar, J., Favrholdt, L.M.: The relative worst order ratio for on-line bin packing algorithms. Technical report PP\u20132003\u201313, Department of Mathematics and Computer Science, University of Southern Denmark (2003)","DOI":"10.1007\/3-540-44849-7_13"},{"issue":"1","key":"35_CR7","first-page":"13","volume":"14","author":"J. Csirik","year":"1999","unstructured":"Csirik, J., Frenk, J.B.G., Labb\u00e9, M., Zhang, S.: Two simple algorithms for bin covering. Acta Cybernetica\u00a014(1), 13\u201325 (1999)","journal-title":"Acta Cybernetica"},{"key":"35_CR8","unstructured":"Csirik, J., Johnson, D.S., Kenyon, C.: Better approximation algorithms for bin covering. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 557\u2013566 (2001)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L., Levy, M.: Online interval coloring and variants. In: Proc. 32nd International Colloquium on Automata, Languages and Programming (2005) (to appear)","DOI":"10.1007\/11523468_49"},{"key":"35_CR10","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell Systems Technical Journal"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00102-1","volume":"67","author":"R. Hassin","year":"1998","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for the maximum traveling salesman problem. Information Processing Letters\u00a067(3), 125\u2013130 (1998)","journal-title":"Information Processing Letters"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S. (ed.): Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1997)","DOI":"10.1145\/261342.571216"},{"issue":"1\u20133","key":"35_CR14","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. Theoretical Computer Science\u00a0306(1\u20133), 543\u2013551 (2003)","journal-title":"Theoretical Computer Science"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S., Demers, A., Ullman, J.D., Garey, M.R., Graham, R.L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comp.\u00a03, 299\u2013325 (1974)","journal-title":"SIAM J. Comp."},{"issue":"1","key":"35_CR16","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D.R. Karger","year":"1997","unstructured":"Karger, D.R., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica\u00a018(1), 82\u201398 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"35_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica\u00a03(1), 79\u2013119 (1988)","journal-title":"Algorithmica"},{"issue":"2","key":"35_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:24Z","timestamp":1605643944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11537311_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}