{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T08:17:32Z","timestamp":1675844252471},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0196-6774(03)00055-5","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T19:51:31Z","timestamp":1054065091000},"page":"360-384","source":"Crossref","is-referenced-by-count":10,"title":["Vector assignment problems: a general framework"],"prefix":"10.1016","volume":"48","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":"78","reference":[{"key":"10.1016\/S0196-6774(03)00055-5_BIB001","series-title":"Proc. 8th ACM\u2013SIAM Symp. on Discrete Algorithms","first-page":"493","article-title":"Approximation schemes for scheduling","author":"Alon","year":"1997"},{"issue":"1","key":"10.1016\/S0196-6774(03)00055-5_BIB002","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","article-title":"Approximation schemes for scheduling on parallel machines","volume":"1","author":"Alon","year":"1998","journal-title":"J. Scheduling"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB003","series-title":"1st Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX98)","first-page":"39","article-title":"Approximation schemes for covering and scheduling on related machines","author":"Azar","year":"1998"},{"issue":"3","key":"10.1016\/S0196-6774(03)00055-5_BIB004","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1137\/0204021","article-title":"Worst-case analysis of a placement algorithm related to storage allocation","volume":"4","author":"Chandra","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(03)00055-5_BIB005","series-title":"Proceedings of the Tenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"185","article-title":"On multi-dimensional packing problems","author":"Chekuri","year":"1999"},{"issue":"1","key":"10.1016\/S0196-6774(03)00055-5_BIB006","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/321921.321933","article-title":"Record allocation for minimizing expected retrieval costs on drum-like storage devices","volume":"23","author":"Cody","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0196-6774(03)00055-5_BIB007","series-title":"Proceedings of the Twelfth Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA-01)","first-page":"586","article-title":"Approximation algorithms for extensible bin packing","author":"Coffman","year":"2001"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB008","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6377(92)90004-M","article-title":"The exact lpt-bound for maximizing the minimum completion time","volume":"11","author":"Csirik","year":"1992","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/S0196-6774(03)00055-5_BIB009","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1+\u03f5 in linear time","volume":"1","author":"Fernandez de la Vega","year":"1981","journal-title":"Combinatorica"},{"issue":"5","key":"10.1016\/S0196-6774(03)00055-5_BIB010","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","article-title":"A 13\/12 approximation algorithm for bin packing with extendable bins","volume":"65","author":"Dell'Olmo","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(03)00055-5_BIB011","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0166-218X(99)00020-7","article-title":"Approximation algorithms for partitioning small items in unequal bins to minimize the total size","volume":"94","author":"Dell'Olmo","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(03)00055-5_BIB012","series-title":"7th Annual European Symposium on Algorithms (ESA'99)","first-page":"151","article-title":"Approximation schemes for scheduling on uniformly related and identical parallel machines","author":"Epstein","year":"1999"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB013","unstructured":"L. Epstein, T. Tassa, Graph based vector assignment schemes, Manuscript, 2002"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB014","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","article-title":"Resource constrained scheduling as generalized bin packing","volume":"21","author":"Garey","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB015","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessor anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0196-6774(03)00055-5_BIB016","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"10.1016\/S0196-6774(03)00055-5_BIB017","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0217033","article-title":"A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach","volume":"17","author":"Hochbaum","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0196-6774(03)00055-5_BIB018","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB019","series-title":"Proc. 23rd Ann. Symp. on Foundations of Computer Science","article-title":"An efficient approximation scheme for the one-dimensional bin-packing problem","author":"Karmarkar","year":"1982"},{"key":"10.1016\/S0196-6774(03)00055-5_BIB020","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0196-6774(03)00055-5_BIB021","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(96)00055-7","article-title":"A polynomial time approximation scheme for maximizing the minimum machine completion time","volume":"20","author":"Woeginger","year":"1997","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"10.1016\/S0196-6774(03)00055-5_BIB022","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0020-0190(97)00179-8","article-title":"There is no asymptotic PTAS for two-dimensional vector packing","volume":"64","author":"Woeginger","year":"1997","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:21:23Z","timestamp":1553138483000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0196677403000555"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00055-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}