The approximation ratio of the greedy algorithm for the metric traveling salesman problem.
Judith BrecklinghausStefan HougardyPublished in: Oper. Res. Lett. (2015)
Keyphrases
- traveling salesman problem
- greedy algorithm
- approximation ratio
- greedy algorithms
- combinatorial optimization
- satisfy the triangle inequality
- ant colony optimization
- optimization problems
- objective function
- worst case
- influence maximization
- dynamic programming
- valid inequalities
- approximation guarantees
- set cover
- greedy strategy
- metric space
- distance metric
- triangle inequality
- distance measure
- subtour elimination
- genetic local search
- approximation algorithms
- knapsack problem
- traveling salesman
- special case
- randomized algorithm
- hamiltonian cycle
- influence spread
- branch and bound
- lower bound