Approximation Hardness of Graphic TSP on Cubic Graphs.
Marek KarpinskiRichard SchmiedPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- traveling salesman problem
- np hard
- computational complexity
- approximation ratio
- graph theory
- graph matching
- approximation algorithms
- approximation error
- error bounds
- learning theory
- genetic algorithm
- graph representation
- complex structures
- graph databases
- weighted graph
- phase transition
- combinatorial optimization
- b spline
- optimization problems
- np hardness
- travelling salesman
- relative error
- graph clustering
- graph theoretic
- information theoretic
- ant colony optimization
- data structure
- optimal solution