Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760)
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: Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP |
scientific article; zbMATH DE number 7525460
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP |
scientific article; zbMATH DE number 7525460 |
Statements
11 May 2022
0 references
traveling salesman problem
0 references
\(k\)-OPT
0 references
bounded degree
0 references
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (English)
0 references
