Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
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
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010