Algorithms for constructing optimal \(n\)-networks in metric spaces (Q1675840)
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 6802688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for constructing optimal \(n\)-networks in metric spaces |
scientific article; zbMATH DE number 6802688 |
Statements
Algorithms for constructing optimal \(n\)-networks in metric spaces (English)
0 references
3 November 2017
0 references
optimal Chebyshev network
0 references
optimal covering
0 references
Chebyshev center
0 references
metric
0 references
Voronoi diagram
0 references
Dirichlet cells
0 references
0.8153989315032959
0 references
0.8038814067840576
0 references
0.7900417447090149
0 references
0.7882293462753296
0 references
