An approximation algorithm for dissecting a rectangle into rectangles with specified areas (Q869574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for dissecting a rectangle into rectangles with specified areas |
scientific article; zbMATH DE number 5131579
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for dissecting a rectangle into rectangles with specified areas |
scientific article; zbMATH DE number 5131579 |
Statements
An approximation algorithm for dissecting a rectangle into rectangles with specified areas (English)
0 references
8 March 2007
0 references
approximation algorithm
0 references
aspect ratio
0 references
dissection
0 references
divide-and-conquer
0 references
floor plan
0 references
facility layout
0 references
NP-hard
0 references
rectangle
0 references
0.997970461845398
0 references
0.8215684294700623
0 references
0.7932174205780029
0 references
0.7814257740974426
0 references
0.75975102186203
0 references
