Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations

DOI10.1007/11758471_21zbMath1183.68298OpenAlexW1497958128MaRDI 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Polynomial-time approximation schemes for circle and other packing problems ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Packing Rectangles into 2OPT Bins Using Rotations ⋮ Absolute approximation ratios for packing rectangles into bins ⋮ Bin packing with controllable item sizes ⋮ Approximation algorithms for orthogonal packing problems for hypercubes

This page was built for publication: Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations