The inverse Voronoi problem in graphs. I: Hardness (Q2006948)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7259202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The inverse Voronoi problem in graphs. I: Hardness |
scientific article; zbMATH DE number 7259202 |
Statements
The inverse Voronoi problem in graphs. I: Hardness (English)
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
0 references
0 references
0.92150575
0 references
0.8772823
0 references
0.8727694
0 references
0.8699992
0 references
0.8643945
0 references
0.86006504
0 references
0.8597511
0 references
0.8594199
0 references
