Approximation algorithms for the TSP with sharpened triangle inequality.
Hans-Joachim BöckenhauerJuraj HromkovicRalf KlasingSebastian SeibertWalter UngerPublished in: Inf. Process. Lett. (2000)
Keyphrases
- approximation algorithms
- triangle inequality
- satisfy the triangle inequality
- np hard
- traveling salesman problem
- quadratic assignment problem
- similarity search
- nearest neighbor
- distance function
- special case
- dissimilarity measure
- combinatorial optimization
- integrality gap
- distance metric
- similarity function
- edit distance
- pre computed
- distance measure
- worst case
- metric space
- minimum cost
- nearest neighbor search
- constant factor
- approximation ratio
- primal dual
- optimal solution
- genetic algorithm
- similarity queries
- linear programming
- ant colony optimization
- feature space
- search space
- lower bound
- scheduling problem
- computational complexity
- metaheuristic
- exact algorithms
- edge weights
- undirected graph
- branch and bound algorithm
- tabu search
- point sets
- knapsack problem
- high dimensional