{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:20:54Z","timestamp":1764174054650,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_5","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"47-59","source":"Crossref","is-referenced-by-count":7,"title":["Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tjark","family":"Vredeveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"van der Zwaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","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.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01, 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"unstructured":"Bonifaci, V., Wiese, A.: Scheduling unrelated machines of few different types. CoRR, abs\/1205.0974 (2012)","key":"5_CR2"},{"doi-asserted-by":"crossref","unstructured":"Calabro, C., Impagliazzo, R., Paturi, R.: A duality between clause width and clause density for SAT. In: IEEE Conference on Computational Complexity, pp. 252\u2013260. IEEE Computer Society (2006)","key":"5_CR3","DOI":"10.1109\/CCC.2006.6"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Comput.\u00a033(4), 837\u2013851 (2004)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F. Eisenbrand","year":"2006","unstructured":"Eisenbrand, F., Shmonin, G.: Carath\u00e9odory bounds for integer cones. Oper. Res. Lett.\u00a034(5), 564\u2013568 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","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\u00a048(2), 360\u2013384 (2003)","journal-title":"J. Algorithms"},{"issue":"6-7","key":"5_CR7","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00236-005-0003-7","volume":"42","author":"L. Epstein","year":"2006","unstructured":"Epstein, L., Tassa, T.: Vector assignment schemes for asymmetric settings. Acta Inf.\u00a042(6-7), 501\u2013514 (2006)","journal-title":"Acta Inf."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A. Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica\u00a07, 49\u201365 (1987)","journal-title":"Combinatorica"},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)","key":"5_CR9"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","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\u00a034(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput.\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/090749451","volume":"24","author":"K. Jansen","year":"2010","unstructured":"Jansen, K.: An eptas for scheduling jobs on uniform processors: Using an milp relaxation with a constant number of integral variables. SIAM J. Discrete Math.\u00a024(2), 457\u2013485 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowskis convex body theorem and integer programming. Mathematics of Operations Research\u00a012, 415\u2013440 (1987)","journal-title":"Mathematics of Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the onedimensional bin-packing problem. In: FOCS, pp. 312\u2013320 (1982)","key":"5_CR15","DOI":"10.1109\/SFCS.1982.61"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Meyerson, A., Roytman, A., Tagiku, B.: Online multidimensional load balancing. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/ RANDOM 2013. LNCS, vol.\u00a08096, pp. 287\u2013302. Springer, Heidelberg (2013)","key":"5_CR17","DOI":"10.1007\/978-3-642-40328-6_21"},{"doi-asserted-by":"crossref","unstructured":"Rothvo\u00df, T.: Approximating bin packing within O(log OPT log log OPT) bins. In: FOCS (2013)","key":"5_CR18","DOI":"10.1109\/FOCS.2013.11"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:23:09Z","timestamp":1746159789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}