Approximation hardness of graphic TSP on cubic graphs (Q3194690)
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 6496800
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation hardness of graphic TSP on cubic graphs |
scientific article; zbMATH DE number 6496800 |
Statements
Approximation hardness of graphic TSP on cubic graphs (English)
0 references
20 October 2015
0 references
traveling salesman problem
0 references
approximability
0 references
0 references
0 references
0 references
0 references
0.9033317
0 references
0.9033317
0 references
0.90167916
0 references
0.9009654
0 references
0.89852345
0 references
0 references
