Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.
Hyung-Chan AnRobert KleinbergDavid B. ShmoysPublished in: ACM Trans. Algorithms (2021)
Keyphrases
- approximation algorithms
- np hard
- branch and bound algorithm
- special case
- vertex cover
- facility location problem
- minimum cost
- worst case
- constant factor
- network design problem
- primal dual
- branch and bound
- combinatorial optimization problems
- precedence constraints
- set cover
- open shop
- approximation ratio
- randomized algorithms
- np hardness
- exact algorithms
- approximation schemes
- genetic algorithm
- constant factor approximation
- global constraints
- constraint satisfaction problems
- optimization problems
- disjoint paths
- lower bound