Computational aspects of packing problems

MaRDI QIDQ4967203zbMATH OpenFDO

Authors Helmut Alt

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/390/370

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial optimization (90C27)

Recommendations

• Complexity and approximation of an area packing problem
• Approximation algorithms for solving packing problems of convex polygons in plane
• Rectangle packing with additional restrictions
• Packing cubes into a cube is NP-hard in the strong sense
• Polynomial-time approximation schemes for circle and other packing problems

Cited in

(15)

• Real time asymptotic packing
• Packing ovals in optimized regular polygons
• Model development and solver demonstrations using randomized test problems
• scientific article; zbMATH DE number 6719727 (Why is no real title available?)
• scientific article; zbMATH DE number 4057528 (Why is no real title available?)
• scientific article; zbMATH DE number 1846851 (Why is no real title available?)
• scientific article; zbMATH DE number 824099 (Why is no real title available?)
• Away from each other
• Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems
• Packing d-dimensional balls into a d + 1-dimensional container
• Complexity and approximation of an area packing problem
• Online packing to minimize area or perimeter
• Improved approximation algorithms for three-dimensional knapsack
• Consequences of the packing problem
• Complexity results for the horizontal bar packing problem

This page was built for publication: Computational aspects of packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4967203)