Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156)
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: Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem |
scientific article; zbMATH DE number 7161795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem |
scientific article; zbMATH DE number 7161795 |
Statements
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (English)
0 references
3 February 2020
0 references
1-line Euclidean minimum Steiner tree
0 references
constrained Euclidean minimum Steiner tree
0 references
Steiner ratio
0 references
approximation algorithms
0 references
complexity
0 references
0 references
0 references
0.902389407157898
0 references
0.8938838243484497
0 references
0.8825566172599792
0 references
0.8360352516174316
0 references
0.8217247724533081
0 references
