Login / Signup

A constant-factor approximation algorithm for the asymmetric traveling salesman problem.

Ola SvenssonJakub TarnawskiLászló A. Végh
Published in: STOC (2018)
Keyphrases
  • constant factor approximation algorithm
  • lower bound
  • branch and bound algorithm
  • branch and bound
  • combinatorial optimization problems
  • constant factor
  • upper bound
  • subtour elimination
  • neural network