The Euclidean bottleneck full Steiner tree problem (Q2258077)
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 6410224
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Euclidean bottleneck full Steiner tree problem |
scientific article; zbMATH DE number 6410224 |
Statements
The Euclidean bottleneck full Steiner tree problem (English)
0 references
2 March 2015
0 references
geometric optimization
0 references
Steiner trees
0 references
bottleneck full Steiner tree problem
0 references
NP-hard
0 references
approximation algorithms
0 references
0 references
0.9967445731163024
0 references
0.8886719346046448
0 references
0.8764042854309082
0 references
0.8760005235671997
0 references
0.8716027736663818
0 references
