{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:08Z","timestamp":1725558368816},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_25","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T11:00:50Z","timestamp":1276167650000},"page":"260-272","source":"Crossref","is-referenced-by-count":3,"title":["Bin Packing with Fixed Number of Bins Revisited"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcta.1998.2926","volume":"86","author":"N. Alon","year":"1999","unstructured":"Alon, N., Ruzsa, I.Z.: Non-averaging subsets and non-vanishing transversals. J. Comb. Theory, Ser. A\u00a086(1), 1\u201313 (1999)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"25_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02566968","volume":"37","author":"R.C. Bose","year":"1962","unstructured":"Bose, R.C., Chowla, S.: Theorems in the additive theory of numbers. Comment. Math. Helv.\u00a037(1), 141\u2013147 (1962-1963)","journal-title":"Comment. Math. Helv."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02170066","volume":"53","author":"A.P. Bosznay","year":"1989","unstructured":"Bosznay, A.P.: On the lower estimation of non-averaging sets. Acta Math. Hung.\u00a053, 155\u2013157 (1989)","journal-title":"Acta Math. Hung."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W.F. Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.: Bin packing can be solved in within 1\u2009+\u2009\u03b5 in linear time. Combinatorica\u00a01, 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"25_CR5","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"J.E.G. Coffman","year":"1997","unstructured":"Coffman, J.E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46\u201393. PWS Publishing, Boston (1997)"},{"key":"25_CR6","first-page":"564","volume":"34","author":"F. Eisenbrand","year":"2006","unstructured":"Eisenbrand, F., Shmonin, G.: Caratheodory bounds for integer cones. OR Letters\u00a034, 564\u2013568 (2006)","journal-title":"OR Letters"},{"key":"25_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"25_CR8","unstructured":"Graham, S.W.: \n                  \n                    \n                  \n                  $B\\sb h$\n                 sequences. In: Analytic number theory. Progr. Math., vol. 1 (1995), vol.\u00a0138, pp. 431\u2013449. Birkh\u00e4user, Boston (1996)"},{"key":"25_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8227-0","volume-title":"Sequences","author":"H. Halberstam","year":"1983","unstructured":"Halberstam, H., Roth, K.F.: Sequences. Springer, New York (1983)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K.: An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. In: ICALP \u201909: 36th International Colloquium on Automata, Languages and Programming, pp. 562\u2013573 (2009)","DOI":"10.1007\/978-3-642-02927-1_47"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. of OR\u00a012, 415\u2013440 (1987)","journal-title":"Math. of OR"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: FOCS 1982: 23rd IEEE Symposium on Foundations of Computer Science, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. Lenstra","year":"1983","unstructured":"Lenstra, H.: Integer programming with a fixed number of variables. Math. of OR\u00a08, 538\u2013548 (1983)","journal-title":"Math. of OR"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S. Plotkin","year":"1995","unstructured":"Plotkin, S., Tardos, D., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math. of OR\u00a020, 257\u2013301 (1995)","journal-title":"Math. of OR"},{"issue":"3","key":"25_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.4064\/aa-65-3-259-282","volume":"65","author":"I.Z. Ruzsa","year":"1993","unstructured":"Ruzsa, I.Z.: Solving a linear equation in a set of integers. I. Acta Arith.\u00a065(3), 259\u2013282 (1993)","journal-title":"Acta Arith."},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Res. Logist.\u00a041(4), 579\u2013585 (1994)","journal-title":"Naval Res. Logist."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:11:14Z","timestamp":1619784674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}