Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP.
Matthias EnglertHeiko RöglinBerthold VöckingPublished in: Electron. Colloquium Comput. Complex. (2006)
Keyphrases
- worst case
- np hard
- computational complexity
- optimal solution
- context free parsing
- preprocessing
- times faster
- theoretical analysis
- improved algorithm
- experimental evaluation
- dynamic programming
- average case
- matching algorithm
- detection algorithm
- objective function
- k means
- running times
- cost function
- computational cost
- knapsack problem
- high accuracy
- traveling salesman problem
- search space
- combinatorial optimization
- computationally efficient
- lower bound
- clustering method
- online algorithms
- error bounds
- data sets
- input data
- optimization algorithm
- generative model
- simulated annealing
- learning algorithm
- upper bound
- probabilistic model
- image segmentation
- special case
- image sequences
- data analysis