A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs.
Jeff EricksonAnastasios SidiropoulosPublished in: SoCG (2014)
Keyphrases
- np hard
- optimal solution
- learning algorithm
- linear programming
- computational complexity
- preprocessing
- detection algorithm
- optimization algorithm
- theoretical analysis
- search space
- dynamic programming
- minimum spanning tree
- objective function
- approximation ratio
- expectation maximization
- segmentation algorithm
- k means
- spanning tree
- closed form
- convergence rate
- finding the shortest path
- graph isomorphism
- graph model
- graph structure
- embedded systems
- approximation algorithms
- knapsack problem
- error bounds
- ant colony optimization
- shortest path
- simulated annealing
- multi objective
- similarity measure