PACKING SOFT RECTANGLES

DOI10.1142/S0129054106004327MaRDI QIDQ5493900zbMATH OpenFDO

Authors Hiroshi Nagamochi

Publication date 16 October 2006

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054106004327

zbMATH Keywords

approximation algorithmaspect ratiofacility layoutfloorplanpackingrectangle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• -soft packings of rectangles
• Algorithm Theory - SWAT 2004
• Exact and approximation algorithms for a soft rectangle packing problem
• scientific article; zbMATH DE number 2042238
• Packing rectangles into a rectangle

Cites work

• A near-optimal solution to a two-dimensional cutting stock problem
• A new mathematical-programming framework for facility-layout design
• Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
• Packing rectangles into the unit square
• Partitioning a square into rectangles: NP-Completeness and approximation algorithms
• The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
• Unsolved problems in geometry

Cited in

(4)

• -soft packings of rectangles
• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
• Exact and approximation algorithms for a soft rectangle packing problem
• Bounds on soft rectangle packing ratios

This page was built for publication: PACKING SOFT RECTANGLES

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