An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
Hans-Joachim BöckenhauerJuraj HromkovicRalf KlasingSebastian SeibertWalter UngerPublished in: STACS (2000)
Keyphrases
- approximation algorithms
- triangle inequality
- np hard
- lower bound
- quadratic assignment problem
- satisfy the triangle inequality
- traveling salesman problem
- worst case
- integrality gap
- optimal solution
- similarity search
- upper bound
- constant factor
- combinatorial optimization
- metric space
- distance function
- nearest neighbor
- branch and bound algorithm
- minimum cost
- pre computed
- edit distance
- branch and bound
- integer programming
- exact algorithms
- scheduling problem
- triangular inequality
- objective function
- special case
- approximation ratio
- distance measure
- dissimilarity measure
- approximation guarantees
- similarity function
- distance metric
- valid inequalities
- ant colony optimization
- linear programming
- optimization problems
- linear programming relaxation
- lower and upper bounds
- genetic algorithm
- search space
- similarity queries
- constraint satisfaction problems
- training set
- polynomial time approximation
- feature space
- computational complexity
- max sat
- evolutionary algorithm
- knn
- linear program
- nearest neighbor search
- undirected graph
- knapsack problem
- greedy algorithm