The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421)
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: The realization problem for Euclidean minimum spanning trees is NP-hard |
scientific article; zbMATH DE number 915695
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The realization problem for Euclidean minimum spanning trees is NP-hard |
scientific article; zbMATH DE number 915695 |
Statements
The realization problem for Euclidean minimum spanning trees is NP-hard (English)
0 references
10 November 1996
0 references
Euclidean minimum spanning tree
0 references
NP-hard
0 references
0.9193395
0 references
0 references
0.8938462
0 references
0.87604916
0 references
0.87349945
0 references
0.87349945
0 references
0.8706417
0 references
0.8706417
0 references
0.8700197
0 references
0.86718535
0 references
