A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.
Katarzyna E. PaluchMarcin MuchaAleksander MadryPublished in: APPROX-RANDOM (2009)
Keyphrases
- traveling salesman problem
- ant colony optimization
- combinatorial optimization
- objective function
- computational complexity
- optimal solution
- discrete particle swarm optimization
- hamiltonian cycle
- search space
- cost function
- dynamic programming
- ant colony optimization algorithm
- np hard
- expectation maximization
- similarity measure
- genetic local search
- minimum spanning tree
- benchmark problems
- np complete