Partitioning a square into rectangles: NP-Completeness and approximation algorithms
From MaRDI portal
Publication:1849374
DOI10.1007/s00453-002-0962-9zbMath1016.68175OpenAlexW1494149077MaRDI QIDQ1849374
Vincent Boudet, Fabrice Rastello, Yves Robert, Olivier Beaumont
Publication date: 1 December 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://hal-lara.archives-ouvertes.fr/hal-02101984/file/RR2000-10.pdf
Related Items (8)
\(\gamma\)-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 ⋮ An approximation algorithm for dissecting a rectangle into rectangles with specified areas ⋮ An approximation algorithm for optimal piecewise linear interpolations of bounded variable products ⋮ On three soft rectangle packing problems with guillotine constraints ⋮ Minimum tiling of a rectangle by squares ⋮ PACKING SOFT RECTANGLES
Uses Software
This page was built for publication: Partitioning a square into rectangles: NP-Completeness and approximation algorithms
