COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD |
scientific article |
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
