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 this page instead for the normal view: Computing a minimum-dilation spanning tree is NP-hard |
scientific article; zbMATH DE number 5345382
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
