An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Arash AsadpourMichel X. GoemansAleksander MadryShayan Oveis GharanAmin SaberiPublished in: SODA (2010)
Keyphrases
- worst case
- cost function
- learning algorithm
- detection algorithm
- dynamic programming
- improved algorithm
- computational complexity
- optimization algorithm
- log log
- times faster
- np hard
- objective function
- k means
- optimal solution
- lower bound
- evolutionary algorithm
- high accuracy
- linear programming
- expectation maximization
- multi objective
- preprocessing
- theoretical analysis
- closed form
- matching algorithm
- monte carlo
- search space
- computationally efficient
- special case