The Euclidean degree-4 minimum spanning tree problem is NP-hard (Q5370716)
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 6794473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Euclidean degree-4 minimum spanning tree problem is NP-hard |
scientific article; zbMATH DE number 6794473 |
Statements
The Euclidean degree-4 minimum spanning tree problem is NP-hard (English)
0 references
20 October 2017
0 references
bounded-degree graphs
0 references
degree-constricted graphs
0 references
degree-restricted graphs
0 references
geometric graphs
0 references
geometric optimization
0 references
NP-complete
0 references
reduction
0 references
spanning trees
0 references
0.8848875761032104
0 references
0.8825902342796326
0 references
0.8580871224403381
0 references
0.8580868244171143
0 references
0.8229318857192993
0 references
