Complexity and approximation of an area packing problem

DOI10.1007/S11590-010-0246-2MaRDI QIDQ691403zbMATH OpenOpenAlexFDO

Authors Cor Hurkens, Andrea Lodi, Silvano Martello, Michele Monaci, Gerhard J. Woeginger

Publication date 30 November 2012

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-010-0246-2

zbMATH Keywords

complexityapproximationworst case analysisarea packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Computational aspects of packing problems
• Rectangle packing with additional restrictions
• Hardness of approximation for orthogonal rectangle packing and covering problems
• Publication:4725744
• An approximation algorithm for square packing.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An approximation algorithm for sequential rectangle placement
• On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
• Scheduling with deadlines and loss functions
• The difference between consecutive primes. II
• The number of primes in a short interval.

Cited in

(4)

• Computational aspects of packing problems
• Symmetry-breaking constraints for packing identical rectangles within polyhedra
• Area-time complexity of the unconstrained minimization problem
• Complexity results for the horizontal bar packing problem

This page was built for publication: Complexity and approximation of an area packing problem

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