A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
Michel X. GoemansNicholas J. A. HarveyKamal JainMohit SinghPublished in: CoRR (2009)
Keyphrases
- times faster
- experimental evaluation
- high accuracy
- computationally efficient
- improved algorithm
- computational cost
- preprocessing
- dynamic programming
- worst case
- linear programming
- cost function
- learning algorithm
- similarity measure
- optimization algorithm
- knapsack problem
- classification algorithm
- mathematical model
- detection algorithm
- theoretical analysis
- computational complexity
- np hard
- genetic algorithm
- greedy algorithm
- randomized algorithms
- expectation maximization
- particle swarm optimization
- input data
- image segmentation