New Approximation Algorithms for (1, 2)-TSP.
Anna AdamaszekMatthias MnichKatarzyna PaluchPublished in: ICALP (2018)
Keyphrases
- approximation algorithms
- np hard
- traveling salesman problem
- special case
- worst case
- facility location problem
- optimal solution
- vertex cover
- ant colony optimization
- approximation ratio
- minimum cost
- combinatorial optimization
- exact algorithms
- np hardness
- set cover
- network design problem
- search space
- genetic algorithm
- computational complexity
- primal dual
- randomized algorithms
- branch and bound algorithm
- lower bound
- optimization problems
- precedence constraints
- valid inequalities
- undirected graph
- scheduling problem
- upper bound
- single machine
- constraint satisfaction problems
- approximation schemes
- open shop
- constant factor approximation