The traveling salesman problem under squared Euclidean distances (Q3113753)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5999700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The traveling salesman problem under squared Euclidean distances |
scientific article; zbMATH DE number 5999700 |
Statements
23 January 2012
0 references
geometric traveling salesman problem
0 references
power-assignment in wireless networks
0 references
distance-power gradient
0 references
NP-hard
0 references
APX-hard
0 references
The Traveling Salesman Problem under squared Euclidean distances (English)
0 references
0.7736484408378601
0 references
0.7601646780967712
0 references
0.7590633630752563
0 references
0.7566882371902466
0 references
0.754938542842865
0 references
