Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem.
Hyung-Chan AnRobert KleinbergDavid B. ShmoysPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- branch and bound algorithm
- worst case
- special case
- vertex cover
- minimum cost
- combinatorial optimization problems
- facility location problem
- branch and bound
- set cover
- primal dual
- lower bound
- randomized algorithms
- approximation ratio
- network design problem
- exact algorithms
- precedence constraints
- np hardness
- upper bound
- optimal solution
- undirected graph
- combinatorial optimization
- linear programming
- simulated annealing
- scheduling problem
- evolutionary algorithm
- approximation schemes
- open shop