Zohar Feldman, Avishai Mandelbaum
WSC 2010
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.
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering
Oliver Bodemer
IBM J. Res. Dev
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev