Improving TSP tours using dynamic programming over tree decompositions (Q5111717)
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 7205008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving TSP tours using dynamic programming over tree decompositions |
scientific article; zbMATH DE number 7205008 |
Statements
27 May 2020
0 references
TSP
0 references
treewidth
0 references
local search
0 references
XP algorithm
0 references
hardness in P
0 references
0 references
0 references
0 references
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. (English)
0 references
0.9971137046813964
0 references
0.8064972162246704
0 references
0.8048080801963806
0 references
0.7920053601264954
0 references
0.7660622000694275
0 references
