Computing a minimum-dilation spanning tree is NP-hard (Q945943)
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 5345382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a minimum-dilation spanning tree is NP-hard |
scientific article; zbMATH DE number 5345382 |
Statements
Computing a minimum-dilation spanning tree is NP-hard (English)
0 references
19 September 2008
0 references
spanner
0 references
dilation
0 references
optimization
0 references
spanning tree
0 references
geometric network
0 references
NP-hardness
0 references
shortest path
0 references
0 references
0.927920937538147
0 references
0.9158405661582948
0 references
0.8574001789093018
0 references
0.8409775495529175
0 references
0.8252299427986145
0 references
