Approximation Hardness of Graphic TSP on Cubic Graphs
Marek KarpinskiRichard SchmiedPublished in: CoRR (2013)
Keyphrases
- np hard
- traveling salesman problem
- approximation algorithms
- error bounds
- approximation error
- learning theory
- ant colony optimization
- travelling salesman
- computational complexity
- search space
- undirected graph
- genetic algorithm
- agnostic learning
- relative error
- graph theoretic
- spanning tree
- np complete
- graph matching
- special case
- graph databases
- directed graph
- worst case
- graph representation
- closed form
- approximation ratio
- approximation methods
- graph clustering
- optimization problems
- error tolerance
- approximation guarantees
- graph structures
- optimal solution
- upper bound
- graph partitioning
- bipartite graph
- lower bound