2 citations · 3 across the 2 of their papers we have counts for
2 papers
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…