4 citations · 7 across the 4 of their papers we have counts for
4 papers
A New Upper Bound on 2D Online Bin Packing
Xin Han, Francis Y. L. Chin, Hing-Fung Ting +1
The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its asymptotic competitive ratio has attracted great research attention. In a long s…
On Two Dimensional Orthogonal Knapsack Problem
Xin Han, Kazuo Iwama, Guochuan Zhang
In this paper, we study the following knapsack problem: Given a list of squares with profits, we are requested to pack a sublist of them into a rectangular bin (not a unit square b…
Strip Packing vs. Bin Packing
Xin Han, Kazuo Iwama, Deshi Ye +1
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm…
New Upper Bounds on The Approximability of 3D Strip Packing
Xin Han, Kazuo Iwama, Guochuan Zhang
In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 a…