4 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2009★ 4 cited
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…
cs.DS2008★ 2 cited
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…
cs.DS2006★ 1 cited
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…