Analysis of a near-metric TSP approximation algorithm.
Sacha KrugPublished in: RAIRO Theor. Informatics Appl. (2013)
Keyphrases
- cost function
- experimental evaluation
- error bounds
- ant colony optimization
- dynamic programming
- computational complexity
- matching algorithm
- np hard
- optimal solution
- distance metric
- detection algorithm
- theoretical analysis
- learning algorithm
- linear programming
- polygonal approximation
- combinatorial optimization
- search space
- computational cost
- preprocessing
- high accuracy
- euclidean distance
- similarity measure
- metric space
- data structure
- traveling salesman problem
- data analysis
- tree structure
- evolutionary algorithm
- distance function
- clustering method
- probabilistic model
- expectation maximization
- input data
- worst case