An Approximation Algorithm for the Clustered Path Travelling Salesman Problem.
Jiaxuan ZhangSuogang GaoBo HouWen LiuPublished in: AAIM (2022)
Keyphrases
- learning algorithm
- experimental evaluation
- times faster
- dynamic programming
- detection algorithm
- expectation maximization
- matching algorithm
- monte carlo
- k means
- improved algorithm
- cost function
- np hard
- convergence rate
- high accuracy
- shortest path problem
- error bounds
- recognition algorithm
- worst case
- approximation ratio
- search space
- optimal path
- polygonal approximation
- solution path
- path planning
- energy function
- theoretical analysis
- particle swarm optimization
- significant improvement
- evolutionary algorithm
- computational complexity
- data structure
- optimal solution
- image segmentation