A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
Jeff EricksonAnastasios SidiropoulosPublished in: CoRR (2013)
Keyphrases
- np hard
- optimal solution
- computational complexity
- search space
- detection algorithm
- dynamic programming
- k means
- learning algorithm
- graph structure
- linear programming
- adjacency graph
- approximation ratio
- convergence rate
- combinatorial optimization
- optimization algorithm
- worst case
- particle swarm optimization
- theoretical analysis
- cost function
- closed form
- multi objective
- objective function
- bayesian networks
- undirected graph
- polygonal approximation
- social networks
- genetic algorithm