Approximating the metric TSP in linear time (Q649110)
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: Approximating the metric TSP in linear time |
scientific article; zbMATH DE number 5982660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the metric TSP in linear time |
scientific article; zbMATH DE number 5982660 |
Statements
Approximating the metric TSP in linear time (English)
0 references
30 November 2011
0 references
traveling salesman problem
0 references
metric graphs
0 references
NP-hardness
0 references
linear-time approximation algorithms
0 references
0 references
0 references
0 references
0.9899864792823792
0 references
0.8253703713417053
0 references
0.8244423866271973
0 references
0.8238124847412109
0 references
