Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102)

From MaRDI portal
Revision as of 20:35, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Exact algorithms and APX-hardness results for geometric packing and covering problems
scientific article

    Statements

    Exact algorithms and APX-hardness results for geometric packing and covering problems (English)
    0 references
    0 references
    0 references
    22 January 2014
    0 references

    Identifiers