Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
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
Raymond Wu, Jie Lu
ITA Conference 2007
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990