Computing a minimum-dilation spanning tree is NP-hard (Q945943): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:10, 30 January 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
