Fast approximation algorithms for a nonconvex covering problem (Q3776651)

From MaRDI portal
Revision as of 01:27, 19 October 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
Fast approximation algorithms for a nonconvex covering problem
scientific article

    Statements

    Fast approximation algorithms for a nonconvex covering problem (English)
    0 references
    0 references
    0 references
    1987
    0 references
    approximation schemes
    0 references
    minimal coverings by nonconvex objects
    0 references
    motion planning
    0 references
    robots
    0 references
    strongly NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references