AbstractIn hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2,…,7
AbstractWe study on-line bounded space bin-packing in the resource augmentation model of competitive...
We consider the problem of packing ddimensional cubes into the minimum number of unit cubes with 2-s...
AbstractWe consider a natural resource allocation problem in which we are given a set of items, wher...
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...
AbstractIn hypercube packing, we receive a sequence of hypercubes that need to be packed into unit h...
Packing a given sequence of items into as few bins as possible in an online fashion is a widely stud...
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A seque...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
In this paper, we study 1-space bounded multi-dimensional bin packing. A sequence of items arrive ov...
In this paper we study the 1-bounded space of 2-dimensional bin pack- ing. A sequence of rectangula...
In Zheng et al. (J Comb Optim 30(2):360–369, 2015) modelled a surgery problem by the one-dimensional...
Abstract. In the bin packing problem we are given an instance consist-ing of a sequence of items wit...
We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded un...
AbstractWe study on-line bounded space bin-packing in the resource augmentation model of competitive...
We consider the problem of packing ddimensional cubes into the minimum number of unit cubes with 2-s...
AbstractWe consider a natural resource allocation problem in which we are given a set of items, wher...
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...
AbstractIn hypercube packing, we receive a sequence of hypercubes that need to be packed into unit h...
Packing a given sequence of items into as few bins as possible in an online fashion is a widely stud...
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A seque...
We solve an open problem in the literature by providing an online algorithm for multidimensional bin...
AbstractIn competitive analysis, we usually do not put any restrictions on the computational complex...
In this paper, we study 1-space bounded multi-dimensional bin packing. A sequence of items arrive ov...
In this paper we study the 1-bounded space of 2-dimensional bin pack- ing. A sequence of rectangula...
In Zheng et al. (J Comb Optim 30(2):360–369, 2015) modelled a surgery problem by the one-dimensional...
Abstract. In the bin packing problem we are given an instance consist-ing of a sequence of items wit...
We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded un...
AbstractWe study on-line bounded space bin-packing in the resource augmentation model of competitive...
We consider the problem of packing ddimensional cubes into the minimum number of unit cubes with 2-s...
AbstractWe consider a natural resource allocation problem in which we are given a set of items, wher...
DOI
Add to ORKG