Hardness of Approximation for Strip Packing

DOI10.1145/3092026zbMath1427.68100arXiv1610.07766WikidataQ58203642 ScholiaQ58203642MaRDI QIDQ4973891

Tomasz Kociumaka, Marcin Pilipczuk, Michał Pilipczuk, Anna Adamaszek

Publication date: 6 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.07766

zbMATH Keywords

strip packing; packing problems; approximation hardness

Mathematics Subject Classification ID

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms