The inverse Voronoi problem in graphs. I: Hardness (Q2006948)

From MaRDI portal
Revision as of 18:15, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
The inverse Voronoi problem in graphs. I: Hardness
scientific article

    Statements

    The inverse Voronoi problem in graphs. I: Hardness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2020
    0 references
    distances in graphs
    0 references
    Voronoi diagram
    0 references
    inverse Voronoi problem
    0 references
    NP-completeness
    0 references
    parameterized complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references