Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations
From MaRDI portal
Publication:3434557
DOI10.1007/11758471_21zbMath1183.68298MaRDI QIDQ3434557
Miroslav Chlebík, Janka Chlebíková
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://researchportal.port.ac.uk/portal/en/publications/inapproximability-results-for-orthogonal-rectangle-packing-problems-with-rotations(7995fec8-a503-4b63-9207-f84d4601985e).html
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Polynomial-time approximation schemes for circle and other packing problems, Bin packing with controllable item sizes, Approximation algorithms for orthogonal packing problems for hypercubes, Approximation and online algorithms for multidimensional bin packing: a survey, Absolute approximation ratios for packing rectangles into bins, Packing Rectangles into 2OPT Bins Using Rotations