Hardness of Approximation for Strip Packing

@article{Adamaszek2017HardnessOA,
  title={Hardness of Approximation for Strip Packing},
  author={A. Adamaszek and Tomasz Kociumaka and Marcin Pilipczuk and Michal Pilipczuk},
  journal={ACM Trans. Comput. Theory},
  year={2017},
  volume={9},
  pages={14:1-14:7}
}
Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, for example, in scheduling and stock-cutting, and has been studied extensively. When the dimensions of the objects are allowed to be exponential in the total input size, it is known that the problem cannot be approximated within a factor better than 3/2, unless P= NP. However… Expand
12 Citations
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
  • 13
  • PDF
Improved approximation for two dimensional Strip Packing with polynomial bounded width
  • 6
A Tight (3/2+ε) Approximation for Skewed Strip Packing
  • 4
  • PDF
Closing the gap for pseudo-polynomial strip packing
  • 10
  • PDF
Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)
  • 1
  • PDF
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width
  • 9
  • Highly Influenced
  • PDF
Approximation and online algorithms for multidimensional bin packing: A survey
  • 83
  • PDF
Framework for ER-Completeness of Two-Dimensional Packing Problems
  • 4
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
  • 4
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
  • 11
  • PDF
...
1
2
...

References

SHOWING 1-2 OF 2 REFERENCES
On approximating strip packing with a better ratio than 3/2
  • 18
  • Highly Influential
Computers and Intractability: A Guide to the Theory of NP-Completeness
  • 47,337
  • Highly Influential
  • PDF