Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.
Katarzyna E. PaluchPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- traveling salesman
- np hard
- traveling salesman problem
- special case
- worst case
- exact algorithms
- minimum cost
- vertex cover
- quadratic assignment problem
- set cover
- global optimization
- primal dual
- open shop
- integrality gap
- approximation ratio
- precedence constraints
- shortest path
- constant factor
- randomized algorithms
- combinatorial auctions
- polynomial time approximation
- approximation schemes
- undirected graph
- disjoint paths
- evolutionary algorithm