A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.
Jesper NederlofJakub PawlewiczCéline M. F. SwennenhuisKarol WegrzyckiPublished in: CoRR (2020)
Keyphrases
- bin packing
- dynamic programming
- memory requirements
- computational complexity
- optimal solution
- objective function
- linear complexity
- database
- packing problem
- expectation maximization
- learning algorithm
- orders of magnitude
- graph theory
- space complexity
- linear programming
- simulated annealing
- search space
- alphabet size
- graph colouring