Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication (Q5144895): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/3357713.3384264 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3035322289 / rank | |||
Normal rank | |||
Latest revision as of 19:44, 19 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
