Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Matthias EnglertHeiko RöglinBerthold VöckingPublished in: Algorithmica (2014)
Keyphrases
- worst case
- dynamic programming
- np hard
- optimal solution
- detection algorithm
- average case
- computational complexity
- data analysis
- search space
- improved algorithm
- matching algorithm
- error bounds
- experimental evaluation
- significant improvement
- learning algorithm
- cost function
- high accuracy
- k means
- space complexity
- traveling salesman problem
- computationally efficient
- times faster
- segmentation algorithm
- theoretical analysis
- recognition algorithm
- neural network
- computational cost
- bayesian networks
- running times
- constant factor
- complexity bounds
- context free parsing