Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.
Hyung-Chan AnRobert D. KleinbergDavid B. ShmoysPublished in: APPROX-RANDOM (2010)
Keyphrases
- approximation algorithms
- np hard
- branch and bound algorithm
- special case
- worst case
- vertex cover
- set cover
- minimum cost
- exact algorithms
- primal dual
- combinatorial optimization problems
- randomized algorithms
- facility location problem
- network design problem
- approximation ratio
- precedence constraints
- np hardness
- branch and bound
- open shop
- approximation schemes
- constant factor
- disjoint paths
- undirected graph
- lower bound
- combinatorial auctions
- computational complexity