7 citations · 18 across the 6 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 7 cited
Approximating the optimal competitive ratio for an ancient online scheduling problem
Lin Chen, Deshi Ye, Guochuan Zhang
We consider the classical online scheduling problem P||C_{max} in which jobs are released over list and provide a nearly optimal online algorithm. More precisely, an online algorit…
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…
cs.DS2006
Improved online hypercube packing
Xin Han, Deshi Ye, Yong Zhou
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic b…