Computing geometric minimum-dilation graphs is NP-hard (Q3562852)
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 geometric minimum-dilation graphs is NP-hard |
scientific article; zbMATH DE number 5713598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing geometric minimum-dilation graphs is NP-hard |
scientific article; zbMATH DE number 5713598 |
Statements
COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (English)
0 references
28 May 2010
0 references
dilation
0 references
geometric network
0 references
plane graph
0 references
tour
0 references
path
0 references
spanning ratio
0 references
stretch factor
0 references
NP-hardness
0 references
0.9707176685333252
0 references
0.9158405661582948
0 references
0.8006957173347473
0 references
0.7914469242095947
0 references
0.790285050868988
0 references
