Bin packing with fixed number of bins revisited

Journal of Computer and System Sciences

Volumn 79, Issue 1, 2013, Pages 39-49

  Jansen, Klaus ^a   Kratsch, Stefan ^b,e   Marx, Dániel ^c   Schlotter, Ildikó ^d  

^a UNIVERSITY OF KIEL   (Germany)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c INSTITUTE FOR COMPUTER SCIENCE AND CONTROL   (Hungary)

^d BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^e UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Additive approximation; Bin Packing; Parameterized complexity; W 1 hardness

Indexed keywords

ADDITIVES; HARDNESS; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

ADDITIVE ERRORS; BIN PACKING; COMPLEXITY ASSUMPTIONS; FIXED NUMBERS; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; RUNNING TIME;

DYNAMIC PROGRAMMING;

EID: 84869496344     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2012.04.004     Document Type: Article

References (20)

1. H.L. Abbott Extremal problems on non-averaging and non-dividing sets Pacific J. Math. 91 1980 1 12
2. N. Alon, and I.Z. Ruzsa Non-averaging subsets and non-vanishing transversals J. Combin. Theory Ser. A 86 1 1999 1 13
3. R.C. Bose, and S. Chowla Theorems in the additive theory of numbers Comment. Math. Helv. 37 1 1962-1963 141 147
4. A.P. Bosznay On the lower estimation of non-averaging sets Acta Math. Hungar. 53 1989 155 157
5. F. Eisenbrand, and G. Shmonin Caratheodory bounds for integer cones Oper. Res. Lett. 34 2006 564 568
6. P. Erdos, and E.G. Straus Non-averaging sets II Combinatorial Theory and its Applications, vol. II Colloquia Mathematica Societatis János Bolyai 4 1970 405 411
7. W. Fernandez de la Vega, and G.S. Lueker Bin packing can be solved in within 1 + ? in linear time Combinatorica 1 1981 349 355
8. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman
9. Bh sequences Analytic Number Theory, vol. 1 1995 Progr. Math. vol. 138 1996 Birkhäuser Boston Boston, MA 431 449
10. R.K. Guy Unsolved Problems in Number Theory third ed. Problem Books in Math. 2004 Springer-Verlag New York
11. H. Halberstam, and K.F. Roth Sequences 1983 Springer-Verlag New York
12. K. Jansen, An EPTAS for scheduling jobs on uniform processors: Using an MILP relaxation with a constant number of integral variables, in: ICALP 09: 36th International Colloquium on Automata, Languages and Programming, 2009, pp. 562-573.
13. R. Kannan Minkowski's convex body theorem and integer programming Math. Oper. Res. 12 1987 415 440
14. N. Karmarkar, R.M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in: FOCS 1982: 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 312-320.
15. H.W. Lenstra Integer programming with a fixed number of variables Math. Oper. Res. 8 1983 538 548
16. D. Marx Can you beat treewidth? Theory Comput. 6 1 2010 85 112
17. S.A. Plotkin, D.B. Shmoys, and E. Tardos Fast approximation algorithms for fractional packing and covering problems Math. Oper. Res. 20 1995 257 301
18. I.Z. Ruzsa Solving a linear equation in a set of integers. I Acta Arith. 65 3 1993 259 282
19. I.Z. Ruzsa Solving a linear equation in a set of integers. II Acta Arith. 72 4 1995 385 397 (Pubitemid 126010784)
20. D. Simchi-Levi New worst-case results for the bin-packing problem Naval Res. Logist. 41 4 1994 579 585