Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495)
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 5183464
| 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 5183464 |
Statements
Computing Geometric Minimum-Dilation Graphs Is NP-Hard (English)
0 references
28 August 2007
0 references
dilation
0 references
geometric network
0 references
plane graph
0 references
spanning ratio
0 references
stretch factor
0 references
NP-hardness
0 references
0.9707176685333252
0 references
0.927920937538147
0 references
0.831836998462677
0 references
0.805014967918396
0 references
0.8004083633422852
0 references
