) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.
Chandra ChekuriMartin PálPublished in: Theory Comput. (2007)
Keyphrases
- traveling salesman
- approximation ratio
- approximation algorithms
- np hard
- special case
- minimum cost
- greedy algorithm
- traveling salesman problem
- search algorithm
- quadratic assignment problem
- approximately optimal
- shortest path
- global optimization
- branch and bound algorithm
- greedy algorithms
- optimal solution
- training data