An approximation algorithm for dissecting a rectangle into rectangles with specified areas
type: Item
instance of: scholarly article
title: An approximation algorithm for dissecting a rectangle into rectangles with specified areas
zbMATH Open document ID: 1107.68122
author: Hiroshi Nagamochi
author: Yuusuke Abe
published in: Discrete Applied Mathematics
publication date: 2007-03-08T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5131579
zbMATH Keywords: approximation algorithm
zbMATH Keywords: aspect ratio
zbMATH Keywords: dissection
zbMATH Keywords: divide-and-conquer
zbMATH Keywords: floor plan
zbMATH Keywords: facility layout
zbMATH Keywords: NP-hard
zbMATH Keywords: rectangle
MaRDI profile type: Publication
full work available at URL: j.dam.2006.08.005
OpenAlex ID: W2014953934
cites work: A new mathematical-programming framework for facility-layout design
cites work: Partitioning a square into rectangles: NP-Completeness and approximation algorithms
cites work: Q4222032
cites work: On optimal guillotine partitions approximating optimal \(d\)-box partitions
cites work: Improved bounds for rectangular and guillotine partitions
cites work: Q4250205
cites work: Tiling a rectangle with the fewest squares
cites work: Q4228435
cites work: The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
cites work: The decomposition of a square into rectangles of minimal perimeter
cites work: Q2753741
cites work: Optimal orientations of cells in slicing floorplan designs
DOI: 10.1016/J.DAM.2006.08.005
description: scientific article; zbMATH DE number 5131579