On the Euclidean bottleneck full Steiner tree problem (Q5404458)
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 6272582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Euclidean bottleneck full Steiner tree problem |
scientific article; zbMATH DE number 6272582 |
Statements
On the euclidean bottleneck full Steiner tree problem (English)
0 references
24 March 2014
0 references
NP-hard
0 references
Steiner tree
0 references
approximation algorithm
0 references
bottleneck full Steiner tree problem
0 references
geometric optimization
0 references
0.9967445731163024
0 references
0.8953009843826294
0 references
0.8855500817298889
0 references
0.8748813271522522
0 references
0.8730192184448242
0 references
