Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
We show that a modification of the Kenyon-Remila algorithm for the strip-packing problem yields an improved bound on the value of the approximate solution. As a corollary we derive that there exists a polynomial-time algorithm that always finds a solution of value OPT+O(OPTlogOPT) where OPT is the optimal value. © 2011 Elsevier B.V. All rights reserved.
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev