Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication (Q5144895)
From MaRDI portal
scientific article; zbMATH DE number 7298229
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
