{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T09:37:16Z","timestamp":1700905036347},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6-7","license":[{"start":{"date-parts":[[2006,1,18]],"date-time":"2006-01-18T00:00:00Z","timestamp":1137542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2006,3,2]]},"DOI":"10.1007\/s00236-005-0003-7","type":"journal-article","created":{"date-parts":[[2006,1,17]],"date-time":"2006-01-17T15:34:24Z","timestamp":1137512064000},"page":"501-514","source":"Crossref","is-referenced-by-count":9,"title":["Vector assignment schemes for asymmetric settings"],"prefix":"10.1007","volume":"42","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":[[2006,1,18]]},"reference":[{"key":"3_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling. In: Proceedings of 8th ACM-SIAM Symp. on Discrete Algorithms (SODA'97), pp. 493\u2013500 (1997)"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Scheduling 1, 55\u201366 (1998)","journal-title":"J. Scheduling"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, L.: Approximation schemes for covering and scheduling on related machines. In: 1st Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX98), pp. 39\u201347 (1998)","DOI":"10.1007\/BFb0053962"},{"key":"3_CR4","unstructured":"Chekuri, C., Khanna, S.: On multi-dimensional packing problems. In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), pp. 185\u2013194 (1999)"},{"key":"3_CR5","unstructured":"Coffman, Jr., E.G., Lueker, G.S.: Approximation algorithms for extensible bin packing. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), pp. 586\u2013588 (2001)"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","volume":"65","author":"P. Dell'Olmo","year":"1998","unstructured":"Dell'Olmo, P., Kellerer, H., Speranza, M.G., Tuza, Z.: A 13\/12 approximation algorithm for bin packing with extendable bins. Inf. Proc. Lett. 65, 229\u2013233 (1998)","journal-title":"Inf. Proc. Lett."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA'99), pp. 151\u2013162 (1999)","DOI":"10.1007\/3-540-48481-7_14"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/S0196-6774(03)00055-5","volume":"48","author":"L. Epstein","year":"2003","unstructured":"Epstein, L., Tassa, T.: Vector assignment problems: A general framework. J. Algorithms 48, 360\u2013384 (2003)","journal-title":"J. Algorithms"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L., Tassa, T.: Vector assignment problems: A general framework. In: Proceedings of the 10th Annual European Symposium on Algorithms (ESA 2002), pp. 461\u2013472 (2002)","DOI":"10.1007\/3-540-45749-6_42"},{"key":"3_CR10","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 multiprocessor anomalies. Bell Sys. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Sys. Tech. J."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. Hochbaum","year":"1988","unstructured":"Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Comput. 17, 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144\u2013162 (1987)","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0003-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-005-0003-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-005-0003-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:52Z","timestamp":1558705312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-005-0003-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,18]]},"references-count":12,"journal-issue":{"issue":"6-7","published-print":{"date-parts":[[2006,3,2]]}},"alternative-id":["3"],"URL":"https:\/\/doi.org\/10.1007\/s00236-005-0003-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1,18]]}}}