The Approximation Ratio of the Greedy Algorithm for the Metric Traveling Salesman Problem.
Judith BrecklinghausStefan HougardyPublished in: CoRR (2014)
Keyphrases
- traveling salesman problem
- greedy algorithm
- approximation ratio
- greedy algorithms
- combinatorial optimization
- ant colony optimization
- objective function
- optimization problems
- worst case
- dynamic programming
- satisfy the triangle inequality
- traveling salesman
- greedy strategy
- approximation guarantees
- set cover
- hamiltonian cycle
- randomized algorithm
- metric space
- approximation algorithms
- valid inequalities
- influence maximization
- distance metric
- distance function
- np hard
- genetic local search
- reinforcement learning
- lower bound