2 papers
cs.DS2017
Online Circle and Sphere Packing
Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier
In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones recei…
cs.DS2015
Locality-preserving allocations Problems and coloured Bin Packing
Andrew Twigg, Eduardo C. Xavier
We study the following problem, introduced by Chung et al. in 2006. We are given, online or offline, a set of coloured items of different sizes, and wish to pack them into bins of…