Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs.

Dániel Marx Ario Salmasi Anastasios Sidiropoulos

Published in: CoRR (2016)

Keyphrases

constant factor
approximation algorithms
lower bound
traveling salesman problem
worst case
approximation guarantees
upper bound
np hard
ant colony optimization
optimal solution
search space
optimization problems
sample complexity
evolutionary algorithm
sample size
learning algorithm
genetic algorithm