{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:47:46Z","timestamp":1754020066044,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676904"},{"type":"electronic","value":"9783540449850"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44985-x_18","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:17:33Z","timestamp":1194985053000},"page":"200-213","source":"Crossref","is-referenced-by-count":7,"title":["Fair versus Unrestricted Bin Packing"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joan","family":"Boyar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lene M.","family":"Favrholdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim S.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten N.","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-Competitive On-Line Routing. In 34th IEEE Symposium on Foundations of Computer Science, pages 32\u201340, 1993.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"18_CR2","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, and A. Ros\u00e9n. Competitive Non-Preemptive Call Control. In Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 312\u2013320, 1994."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line Admission Control and Circuit Routing for High Performance Computation and Communication. In 35th IEEE Symposium on Foundations of Computer Science, pages 412\u2013423, 1994.","DOI":"10.1109\/SFCS.1994.365675"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/PL00009286","volume":"25","author":"J. Boyar","year":"1999","unstructured":"J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403\u2013417, 1999.","journal-title":"Algorithmica"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function \u2014 A Generalization of the Competitive Ratio. Tech. report 24, Department of Mathematics and Computer Science, University of Southern Denmark, Main Campus: Odense University, 1998. Extended version submitted for journal publication 1999.","DOI":"10.1007\/3-540-48447-7_9"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-48447-7_9","volume-title":"Sixth International Workshop on Algorithms and Data Structures","author":"J. Boyar","year":"1999","unstructured":"J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function \u2014 A Generalization of the Competitive Ratio. In Sixth International Workshop on Algorithms and Data Structures, volume 1663 of Lecture Notes in Computer Science, pages 74\u201379. Springer-Verlag, 1999."},{"key":"18_CR7","unstructured":"E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin Packing: A Survey. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 2, pages 46\u201393. PWS Publishing Company, 1997."},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF00288885","volume":"9","author":"E. G. Coffman Jr.","year":"1978","unstructured":"E. G. Coffman, Jr., J. Y-T. Leung, and D. W. Ting. Bin Packing: Maximizing the Number of Pieces Packed. Acta Informatica, 9:263\u2013271, 1978.","journal-title":"Acta Informatica"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/0208016","volume":"8","author":"E. G. Coffman Jr.","year":"1979","unstructured":"E. G. Coffman, Jr. and Joseph Y-T. Leung. Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. SIAM J. Comput., 8:202\u2013217, 1979.","journal-title":"SIAM J. Comput."},{"key":"18_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029568","volume-title":"Online Algorithms","author":"J. Csirik","year":"1998","unstructured":"J. Csirik and G. Woeginger. On-Line Packing and Covering Problems. In Gerhard J. Woeginger Amos Fiat, editor, Online Algorithms, volume 1442 of Lecture Notes in Computer Science, chapter 7, pages 147\u2013177. Springer-Verlag, 1998."},{"key":"18_CR11","unstructured":"A. Fiat. Personal communication, 1999."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44985-X_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:18:09Z","timestamp":1737533889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44985-X_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676904","9783540449850"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44985-x_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}