Add to ORKGPacking a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing hypercubes into bins in two or more dimensions, once for general algorithms (in two dimensions) and once for an important subclass, so-called Harmonic-type algorithms (in two or more dimensions). Lastly, we show that two adaptions of the ideas from the best known one-dimensional packing algorithm to square packing also do not help to break the barrier of 2
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
The Cube Packing Problem (CPP) is defined as follows. Find a packing of a given list of (small) cube...
In the $d$-dimensional hypercube bin packing problem, a given list of$d$-dimensional hypercubes must...
Packing a given sequence of items into as few bins as possible in an online fashion is a widely stud...
AbstractIn hypercube packing, we receive a sequence of hypercubes that need to be packed into unit h...
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercube...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of s...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A seque...
New upper and lower bounds are presented for a multi-dimensional generalization of bin packing calle...
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its ...
We revisit the classic online bin packing problem studied in the half-century. In this problem, item...
In this paper we study the 1-bounded space of 2-dimensional bin pack- ing. A sequence of rectangula...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
The Cube Packing Problem (CPP) is defined as follows. Find a packing of a given list of (small) cube...
In the $d$-dimensional hypercube bin packing problem, a given list of$d$-dimensional hypercubes must...
Packing a given sequence of items into as few bins as possible in an online fashion is a widely stud...
AbstractIn hypercube packing, we receive a sequence of hypercubes that need to be packed into unit h...
In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercube...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of s...
We improve the lower bound on the asymptotic competitive ratio of any online algorithm for bin packi...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A seque...
New upper and lower bounds are presented for a multi-dimensional generalization of bin packing calle...
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its ...
We revisit the classic online bin packing problem studied in the half-century. In this problem, item...
In this paper we study the 1-bounded space of 2-dimensional bin pack- ing. A sequence of rectangula...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
The Cube Packing Problem (CPP) is defined as follows. Find a packing of a given list of (small) cube...
In the $d$-dimensional hypercube bin packing problem, a given list of$d$-dimensional hypercubes must...