Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374): Difference between revisions
From MaRDI portal
Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-002-0962-9 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1494149077 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-002-0962-9 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a square into rectangles: NP-Completeness and approximation algorithms |
scientific article |
Statements
Partitioning a square into rectangles: NP-Completeness and approximation algorithms (English)
0 references
1 December 2002
0 references
heterogeneous parallel computing
0 references
