Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (Q3222847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3889530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle |
scientific article; zbMATH DE number 3889530 |
Statements
Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle (English)
0 references
1983
0 references
packing squares into a rectangle
0 references
approximation algorithms
0 references
comparison between algorithms
0 references
subset problem
0 references
Bottom-Up-Increasing rule
0 references
BUI
0 references
Next- Fit-Increasing rule
0 references
NFI
0 references
0.879703164100647
0 references
0.8559279441833496
0 references
0.829571008682251
0 references
0.827662467956543
0 references
0.8244154453277588
0 references
