Parameterized Approximation Algorithms for TSP.
Jianqi ZhouPeihua LiJiong GuoPublished in: ISAAC (2022)
Keyphrases
- approximation algorithms
- np hard
- traveling salesman problem
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- optimal solution
- combinatorial optimization
- primal dual
- search space
- network design problem
- set cover
- ant colony optimization
- randomized algorithms
- linear programming
- exact algorithms
- genetic algorithm
- approximation schemes
- lower bound
- precedence constraints
- open shop
- optimization problems
- approximation ratio
- disjoint paths
- constant factor
- combinatorial auctions
- computational complexity
- np hardness
- linear program
- scheduling problem