A time- and space-optimal algorithm for the many-visits TSP.
André BergerLászló KozmaMatthias MnichRoland VinczePublished in: SODA (2019)
Keyphrases
- optimal solution
- search space
- dynamic programming
- np hard
- worst case
- detection algorithm
- globally optimal
- objective function
- recognition algorithm
- optimization algorithm
- matching algorithm
- experimental evaluation
- locally optimal
- improved algorithm
- k means
- preprocessing
- times faster
- computational complexity
- ant colony optimization
- exhaustive search
- computationally efficient
- learning algorithm
- particle swarm optimization
- computational cost
- segmentation algorithm
- metaheuristic
- closed form
- simulated annealing
- combinatorial optimization
- convergence rate
- high accuracy
- significant improvement
- similarity measure
- higher dimensional
- optimal path
- space requirements
- decision trees