Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
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
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS