Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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
Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021