{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:59:17Z","timestamp":1725487157993},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_42","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:42:44Z","timestamp":1183549364000},"page":"461-473","source":"Crossref","is-referenced-by-count":1,"title":["Vector Assignment Problems: A General Framework"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"42_CR1","unstructured":"N. Alon, Y. Azar, G. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proc. 8th ACM-SIAM Symp. on Discrete Algorithms, pages 493\u2013500, 1997."},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/0204021","volume":"4","author":"A.K. Chandra","year":"1975","unstructured":"A.K. Chandra and C. K. Wong. Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing, 4(3):249\u2013263, 1975.","journal-title":"SIAM Journal on Computing"},{"key":"42_CR3","unstructured":"C. Chekuri and S. Khanna. On multi-dimensional packing problems. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 185\u2013194, 1999."},{"issue":"1","key":"42_CR4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/321921.321933","volume":"23","author":"R.A. Cody","year":"1976","unstructured":"R.A. Cody and E. G. Coffman, Jr. Record allocation for minimizing expected retrieval costs on drum-like storage devices. J. Assoc. Comput. Mach., 23(1):103\u2013115, 1976.","journal-title":"J. Assoc. Comput. Mach."},{"key":"42_CR5","unstructured":"E.G. Coffman, Jr. and George S. Lueker. Approximation algorithms for extensible bin packing. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 586\u2013588, 2001."},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","volume":"11","author":"J. Csirik","year":"1992","unstructured":"J. Csirik, H. Kellerer, and G. Woeginger. The exact lpt-bound for maximizing the minimum completion time. Operations Research Letters, 11:281\u2013287, 1992.","journal-title":"Operations Research Letters"},{"issue":"4","key":"42_CR7","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. F. Vega de la","year":"1981","unstructured":"W. F. de la Vega and G. S. Lueker. Bin packing can be solved within 1 + \u2208 in linear time. Combinatorica, 1(4):349\u2013355, 1981.","journal-title":"Combinatorica"},{"issue":"5","key":"42_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","volume":"65","author":"P. Dell\u2019Olmo","year":"1998","unstructured":"P. Dell\u2019Olmo, H. Kellerer, M. G. Speranza, and Zs. Tuza. A 13\/12 approximation algorithm for bin packing with extendable bins. Information Processing Letters, 65(5):229\u2013233, 1998.","journal-title":"Information Processing Letters"},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(99)00020-7","volume":"94","author":"P. Dell\u2019Olmo","year":"1999","unstructured":"P. Dell\u2019Olmo and M. G. Speranza. Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discrete Applied Mathematics, 94:181\u2013191, 1999.","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","volume":"21","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey, R. L. Graham, D. S. Johnson, and A.C.C. Yao. Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory (Series A), 21:257\u2013298, 1976.","journal-title":"Journal of Combinatorial Theory (Series A)"},{"key":"42_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":"R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563\u20131581, 1966.","journal-title":"Bell System Technical Journal"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math, 17:416\u2013429, 1969.","journal-title":"SIAM J. Appl. Math"},{"issue":"1","key":"42_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D. S. Hochbaum","year":"1987","unstructured":"D. S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: theoretical and practical results. Journal of the ACM, 34(1):144\u2013162, 1987.","journal-title":"Journal of the ACM"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proc. 23rd Ann. Symp. on Foundations of Computer Science, 1982.","DOI":"10.1109\/SFCS.1982.61"},{"key":"42_CR15","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni. Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery, 23:116\u2013127, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","volume":"20","author":"G. J. Woeginger","year":"1997","unstructured":"G. J. Woeginger. A polynomial time approximation scheme for maximizing the minimum machine completion time. Operations Research Letters, 20:149\u2013154, 1997.","journal-title":"Operations Research Letters"},{"issue":"6","key":"42_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","volume":"64","author":"G. J. Woeginger","year":"1997","unstructured":"G. J. Woeginger. There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters, 64(6):293\u2013297, 1997.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T18:04:40Z","timestamp":1550426680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}