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
AbstractThe modified harmonic bin packing algorithm, and Hu and Kahng's unnamed algorithm, are varia...
Abstract. In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A se...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...
Packing a given sequence of items into as few bins as possible in an online fashion is a widely stud...
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...
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its ...
We consider the problem of packing ddimensional cubes into the minimum number of unit cubes with 2-s...
Abstract In this thesis, we deal with two packing problems: the online bin packing and the geometric...
We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded un...
textabstractWe solve an open problem in the literature by providing an online algorithm for multidim...
textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line alg...
New upper and lower bounds are presented for a multi-dimensional generalization of bin packing calle...
In the $d$-dimensional hypercube bin packing problem, a given list of$d$-dimensional hypercubes must...
AbstractThe modified harmonic bin packing algorithm, and Hu and Kahng's unnamed algorithm, are varia...
Abstract. In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A se...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...
Packing a given sequence of items into as few bins as possible in an online fashion is a widely stud...
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...
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its ...
We consider the problem of packing ddimensional cubes into the minimum number of unit cubes with 2-s...
Abstract In this thesis, we deal with two packing problems: the online bin packing and the geometric...
We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded un...
textabstractWe solve an open problem in the literature by providing an online algorithm for multidim...
textabstractIn this paper we discuss lower bounds for the asymptotic worst case ratio of on-line alg...
New upper and lower bounds are presented for a multi-dimensional generalization of bin packing calle...
In the $d$-dimensional hypercube bin packing problem, a given list of$d$-dimensional hypercubes must...
AbstractThe modified harmonic bin packing algorithm, and Hu and Kahng's unnamed algorithm, are varia...
Abstract. In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A se...
AbstractOn-line algorithms have been extensively studied for the one-dimensional bin packing problem...