On two geometric problems related to the travelling salesman problem (Q3343801)
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: On two geometric problems related to the travelling salesman problem |
scientific article; zbMATH DE number 3878709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On two geometric problems related to the travelling salesman problem |
scientific article; zbMATH DE number 3878709 |
Statements
On two geometric problems related to the travelling salesman problem (English)
0 references
1984
0 references
NP-completeness
0 references
Euclidean degree-K minimum spanning tree
0 references
heuristic algorithm
0 references
traveling salesman
0 references
0.8268958926200867
0 references
0.8036668300628662
0 references
0.8016350865364075
0 references
0.8016349077224731
0 references
