Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication.
Jesper NederlofPublished in: STOC (2020)
Keyphrases
- matrix multiplication
- traveling salesman problem
- message passing
- matrix factorization
- distributed memory
- travelling salesman
- bipartite graph
- graph model
- optimization problems
- ant colony optimization
- computational complexity
- objective function
- genetic algorithm
- pairwise
- real valued
- search space
- graph partitioning
- object recognition
- collaborative filtering
- input image
- dynamic programming
- lower bound
- parallel implementation
- image processing