Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs.
Dániel MarxArio SalmasiAnastasios SidiropoulosPublished in: APPROX-RANDOM (2016)
Keyphrases
- bayesian networks
- constant factor
- approximation algorithms
- lower bound
- traveling salesman problem
- worst case
- upper bound
- np hard
- approximation guarantees
- search space
- genetic algorithm
- optimization problems
- sample complexity
- special case
- combinatorial optimization
- theoretical analysis
- search algorithm
- learning algorithm
- machine learning