8/7-Approximation Algorithm for (1,2)-TSP
Piotr BermanMarek KarpinskiPublished in: Electron. Colloquium Comput. Complex. (2005)
Keyphrases
- search space
- learning algorithm
- computational complexity
- approximation ratio
- detection algorithm
- experimental evaluation
- np hard
- optimal solution
- ant colony optimization
- optimization algorithm
- similarity measure
- significant improvement
- computational cost
- expectation maximization
- path planning
- cost function
- error bounds
- objective function
- convex hull
- monte carlo
- theoretical analysis
- matching algorithm
- preprocessing
- simulated annealing
- high accuracy
- closed form
- combinatorial optimization
- recognition algorithm
- improved algorithm
- times faster
- input data
- approximation algorithms
- neural network
- clustering method
- clustering algorithm
- computationally efficient
- optimization problems
- worst case
- probabilistic model
- dynamic programming
- bayesian networks
- special case
- evolutionary algorithm
- reinforcement learning
- association rules
- data structure