On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (Q6567757)
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 7876715
| 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 7876715 |
Statements
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees (English)
0 references
5 July 2024
0 references
