Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374)

From MaRDI portal
Revision as of 02:56, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2002
    0 references
    0 references
    heterogeneous parallel computing
    0 references
    0 references