Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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.
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Limin Hu
IEEE/ACM Transactions on Networking
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization