A (3/2+1/e)-Approximation Algorithm for Ordered TSP.
Susanne ArmbrusterMatthias MnichMartin NägelePublished in: CoRR (2024)
Keyphrases
- optimal solution
- search space
- high accuracy
- objective function
- dynamic programming
- detection algorithm
- times faster
- k means
- computational complexity
- optimization algorithm
- cost function
- np hard
- experimental evaluation
- computational cost
- computationally efficient
- recognition algorithm
- clustering method
- matching algorithm
- learning algorithm
- traveling salesman problem
- similarity measure
- preprocessing
- probabilistic model
- energy function
- motion estimation
- improved algorithm
- error tolerance
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- linear programming
- simulated annealing
- data sets
- significant improvement
- neural network