A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244)
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 6013422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) |
scientific article; zbMATH DE number 6013422 |
Statements
A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (English)
0 references
9 March 2012
0 references
Steiner tree
0 references
Delaunay triangulation
0 references
0 references
0.8768057227134705
0 references
0.857914388179779
0 references
0.8483726382255554
0 references
0.8470969200134277
0 references
