Publication
Information Processing Letters
Paper

A note on the Kenyon-Remila strip-packing algorithm

View publication

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.

Date

Publication

Information Processing Letters

Authors

Topics

Share