Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Paper
A note on the Kenyon-Remila strip-packing algorithm
Abstract
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.
Related
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Kento Tsubouchi, Yosuke Mitsuhashi, et al.
npj Quantum Information
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006