Bin packing via discrepancy of permutations

A well studied special case of bin packing is the 3-partition problem, where n items of size > 1/4 have to be packed in a minimum number of bins of capacity one. The famous Karmarkar-Karp algorithm transforms a fractional solution of a suitable LP relaxation for this problem into an integral solution that requires at most O(log n) additional bins. The three-permutations-conjecture of Beck is the following. Given any 3 permutations on n symbols, one can color the symbols red and blue, such that in any interval of any of those permutations, the number of red and blue symbols differs only by a constant. Beck's conjecture is well known in the field of discrepancy theory. We establish a surprising connection between bin packing and Beck's conjecture: If the latter holds true, then the additive integrality gap of the 3-partition linear programming relaxation is bounded by a constant.

[1]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[2]  Géza Bohus,et al.  On the Discrepancy of 3 Permutations , 1990, Random Struct. Algorithms.

[3]  Nikhil Bansal,et al.  Constructive Algorithms for Discrepancy Minimization , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[4]  Thomas Rothvoß,et al.  Bin Packing via Discrepancy of Permutations Friedrich Eisenbrand , 2010 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[7]  Aravind Srinivasan,et al.  Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems , 1997, SODA '97.

[8]  László Lovász,et al.  Discrepancy of Set-systems and Matrices , 1986, Eur. J. Comb..

[9]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[10]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[11]  J. Matousek,et al.  Geometric Discrepancy: An Illustrated Guide , 2009 .

[12]  David P. Williamson.  Lecture notes on approximation algorithms: Fall 1998 , 1999 .

[13]  Aleksandar Nikolov,et al.  A counterexample to Beck's conjecture on the discrepancy of three permutations , 2011, ArXiv.

[14]  Klaus Jansen,et al.  An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths , 2010, IPCO.

[15]  Aravind Srinivasan,et al.  The discrepancy of permutation families , 1997 .

[16]  Guntram Scheithauer,et al.  Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem , 1997, Oper. Res. Lett..

[17]  Kurt Eisemann,et al.  The Trim Problem , 1957 .

[18]  W. Banaszczyk.  Balancing vectors and Gaussian measures of n -dimensional convex bodies , 1998 .

[19]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[20]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[21]  Wojciech Banaszczyk,et al.  Balancing vectors and Gaussian measures of n-dimensional convex bodies , 1998, Random Struct. Algorithms.

[22]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[23]  Aleksandar Nikolov,et al.  Tight hardness results for minimizing discrepancy , 2011, SODA '11.

[24]  György Dósa,et al.  The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9 , 2007, ESCAPE.

[25]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[26]  J. Spencer.  Six standard deviations suffice , 1985 .

[27]  J. Beck,et al.  Discrepancy Theory , 1996 .