Fine-grained complexity analysis of two classic TSP variants (Q4598137)
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 6820194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fine-grained complexity analysis of two classic TSP variants |
scientific article; zbMATH DE number 6820194 |
Statements
19 December 2017
0 references
traveling salesman problem
0 references
fine-grained complexity
0 references
bitonic tours
0 references
\(k\)-OPT
0 references
Fine-grained complexity analysis of two classic TSP variants (English)
0 references
0.8048080801963806
0 references
0.799759030342102
0 references
0.7768867015838623
0 references
0.7696529030799866
0 references
