A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP.
Sándor Kisfaludi-BakPublished in: SoCG (2020)
Keyphrases
- detection algorithm
- computational cost
- optimal solution
- dynamic programming
- np hard
- learning algorithm
- preprocessing
- computationally efficient
- improved algorithm
- times faster
- optimization algorithm
- objective function
- search space
- cost function
- expectation maximization
- computational complexity
- traveling salesman problem
- combinatorial optimization
- neural network
- particle swarm optimization
- maximum likelihood
- linear programming
- worst case
- experimental evaluation
- significant improvement
- markov random field
- k means
- segmentation algorithm
- clustering algorithm
- lower bound
- convergence rate
- recognition algorithm
- data structure