An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (Q390152)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm for the Euclidean bottleneck full Steiner tree problem |
scientific article; zbMATH DE number 6249157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for the Euclidean bottleneck full Steiner tree problem |
scientific article; zbMATH DE number 6249157 |
Statements
An optimal algorithm for the Euclidean bottleneck full Steiner tree problem (English)
0 references
22 January 2014
0 references
minimum spanning tree
0 references
Steiner tree
0 references
bottleneck length
0 references
Yao graph
0 references
0.8767064809799194
0 references
0.8730192184448242
0 references
0.8716027736663818
0 references
0.8705698847770691
0 references
