A note on the Kenyon-Remila strip-packing algorithm

Authors:
Maxim Sviridenko
Affiliations:
IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
Venue:
Information Processing Letters
Year:
2012

Citing 3
Cited 0

A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem

Mathematics of Operations Research
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
New approximability results for 2-dimensional packing problems

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

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.