Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119)

From MaRDI portal
Revision as of 11:51, 8 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Maximum-weight planar boxes in \(O(n^2)\) time (and better)
scientific article

    Statements

    Maximum-weight planar boxes in \(O(n^2)\) time (and better) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 April 2014
    0 references
    0 references
    computational geometry
    0 references
    maximum box
    0 references
    divide-summarize-and-conquer
    0 references
    adaptive algorithms
    0 references
    Klee's measure problem
    0 references
    0 references