On shortest two-connected Steiner networks with Euclidean distance (Q4540072)
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: On shortest two-connected Steiner networks with Euclidean distance |
scientific article; zbMATH DE number 1769316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On shortest two-connected Steiner networks with Euclidean distance |
scientific article; zbMATH DE number 1769316 |
Statements
21 July 2002
0 references
shortest two-connected Steiner network
0 references
Euclidean plane
0 references
polynomial-time algorithm
0 references
On shortest two-connected Steiner networks with Euclidean distance (English)
0 references
0.8905918002128601
0 references
0.8899962902069092
0 references
0.8744447827339172
0 references
0.8672266006469727
0 references
