Approximation hardness of graphic TSP on cubic graphs.
Marek KarpinskiRichard SchmiedPublished in: RAIRO Oper. Res. (2015)
Keyphrases
- traveling salesman problem
- np hard
- travelling salesman
- approximation algorithms
- ant colony optimization
- approximation ratio
- graph model
- graph mining
- agnostic learning
- approximation error
- graph theory
- genetic algorithm
- graph theoretic
- error bounds
- graph matching
- complex networks
- learning theory
- information theoretic
- graph structure
- np complete
- optimization problems
- worst case
- computational complexity
- linear programming
- undirected graph
- graph construction
- optimal solution
- neural network