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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-020-00716-4 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-020-00716-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3027090837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fitting Voronoi Diagrams to Planar Tesselations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Dirichlet tesselations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi game on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum consistent subset problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Cut Graph of a Surface with Prescribed Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph induced complex on point data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advantage in the discrete Voronoi game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Sample Compression for Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Reconstruction and Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight triangulation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial Analysis along Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for a selective nearest neighbor decision rule (Corresp.) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-020-00716-4 / rank
 
Normal rank

Latest revision as of 18:15, 16 December 2024

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