An Improved Approximation Algorithm for TSP with Distances One and Two.
Markus BläserL. Shankar RamPublished in: FCT (2005)
Keyphrases
- np hard
- search space
- detection algorithm
- learning algorithm
- computational cost
- improved algorithm
- optimal solution
- error bounds
- dynamic programming
- ant colony optimization
- times faster
- cost function
- recognition algorithm
- high accuracy
- significant improvement
- computational complexity
- computationally efficient
- theoretical analysis
- objective function
- optimization algorithm
- similarity measure
- input data
- convergence rate
- distance matrix
- matching algorithm
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- multi objective
- decision trees
- feature selection