On approximating strip packing with a better ratio than 3/2

DOI10.1137/1.9781611974331.ch102zbMath1394.68442OpenAlexW4231639237MaRDI QIDQ4575686

Giorgi Nadiradze, Andreas Wiese

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch102

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (8)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Peak demand minimization via sliced strip packing ⋮ An improved approximation algorithm for scheduling monotonic moldable tasks ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Improved approximation for two dimensional strip packing with polynomial bounded width ⋮ Complexity and inapproximability results for parallel task scheduling and strip packing ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing

This page was built for publication: On approximating strip packing with a better ratio than 3/2