Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication (Q5144895): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 19:59, 5 March 2024
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
