Fine-grained Complexity Analysis of Two Classic TSP Variants (Q5028342)
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 7471490
| 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 7471490 |
Statements
Fine-grained Complexity Analysis of Two Classic TSP Variants (English)
0 references
8 February 2022
0 references
traveling salesman problem
0 references
bitonic TSP
0 references
fine-grained complexity
0 references
\(k\)-OPT
0 references
0.99999976
0 references
0.89430016
0 references
0.8863673
0 references
0.87647605
0 references
0.87647605
0 references
0.8743778
0 references
0.87065184
0 references
0.87039876
0 references
0.86542785
0 references
