New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.
Katarzyna PaluchPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- traveling salesman
- np hard
- traveling salesman problem
- special case
- worst case
- quadratic assignment problem
- primal dual
- vertex cover
- approximation schemes
- minimum cost
- integrality gap
- randomized algorithms
- constant factor
- global optimization
- precedence constraints
- open shop
- polynomial time approximation
- disjoint paths
- constant factor approximation
- approximation ratio
- set cover
- undirected graph
- lower bound
- bayesian networks
- mathematical model
- ant colony optimization
- shortest path
- genetic algorithm