An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4.
Mingyu XiaoHiroshi NagamochiPublished in: Theory Comput. Syst. (2016)
Keyphrases
- computational cost
- np hard
- computational complexity
- ant colony optimization
- optimal solution
- high accuracy
- preprocessing
- search space
- cost function
- experimental evaluation
- learning algorithm
- detection algorithm
- matching algorithm
- k means
- recognition algorithm
- clustering method
- combinatorial optimization
- traveling salesman problem
- optimization algorithm
- expectation maximization
- probabilistic model
- dynamic programming
- random graphs
- graph model
- graph partitioning
- brute force
- approximation algorithms
- graph isomorphism
- convergence rate
- times faster
- tree structure
- simulated annealing
- worst case
- significant improvement
- search algorithm
- objective function