Computing a minimum-dilation spanning tree is NP-hard (Q945943): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 02:42, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing a minimum-dilation spanning tree is NP-hard |
scientific article |
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