On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q1386771)
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 the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees |
scientific article; zbMATH DE number 1156898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees |
scientific article; zbMATH DE number 1156898 |
Statements
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (English)
0 references
10 November 1998
0 references
minimum spanning trees
0 references
traveling salesman tours
0 references
0.8436124920845032
0 references
0.8137345910072327
0 references
