Efficient algorithms for the largest rectangle problem (Q1193696)
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: Efficient algorithms for the largest rectangle problem |
scientific article; zbMATH DE number 64991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for the largest rectangle problem |
scientific article; zbMATH DE number 64991 |
Statements
Efficient algorithms for the largest rectangle problem (English)
0 references
27 September 1992
0 references
largest rectangle problem
0 references
bounding isothetic rectangle
0 references
0.92163825
0 references
0 references
0 references
0.8873855
0 references
0.8839028
0 references
0.8804983
0 references
0.8787364
0 references
0.8761464
0 references
