Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374)
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 1837016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning a square into rectangles: NP-Completeness and approximation algorithms |
scientific article; zbMATH DE number 1837016 |
Statements
Partitioning a square into rectangles: NP-Completeness and approximation algorithms (English)
0 references
1 December 2002
0 references
heterogeneous parallel computing
0 references
0.8174195289611816
0 references
0.8063872456550598
0 references
0.8043226003646851
0 references
0.8037377595901489
0 references
0.7982664704322815
0 references
