A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem.

Ola Svensson Jakub Tarnawski László A. Végh

Published in: CoRR (2017)

Keyphrases

constant factor approximation algorithm
lower bound
branch and bound algorithm
branch and bound
constant factor
combinatorial optimization problems
upper bound
approximation algorithms
np hard
subtour elimination
neural network
worst case
knapsack problem