Approximating TSP walks in subcubic graphs.
Michael C. WigalYoungho YooXingxing YuPublished in: CoRR (2021)
Keyphrases
- traveling salesman problem
- travelling salesman
- genetic algorithm
- graph theory
- ant colony optimization
- graph matching
- graph theoretic
- optimal solution
- search space
- directed graph
- graph structures
- optimization problems
- object recognition
- data sets
- graph structure
- graph model
- graph databases
- graph partitioning
- clustering algorithm
- series parallel
- structured objects
- neural network