Computing a minimum-dilation spanning tree is NP-hard (Q945943): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2007.12.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065889331 / rank | |||
Normal rank | |||
Revision as of 21:55, 19 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
