Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication (Q5144895)
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 7298229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication |
scientific article; zbMATH DE number 7298229 |
Statements
Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication (English)
0 references
19 January 2021
0 references
exponential time algorithms
0 references
traveling salesman problem
0 references
0.8116096258163452
0 references
0.7995243668556213
0 references
0.7860395908355713
0 references
0.7793951630592346
0 references
0.7760432362556458
0 references
