B. Wagle
EJOR
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.
B. Wagle
EJOR
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
B.K. Boguraev, Mary S. Neff
HICSS 2000
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989