Improved Approximations for Ordered TSP on Near-Metric Graphs, .
Hans-Joachim BöckenhauerMonika SteinováPublished in: SOFSEM (2013)
Keyphrases
- traveling salesman problem
- error metrics
- maximum common subgraph
- ant colony optimization
- combinatorial optimization
- closed form
- np hard
- distance function
- euclidean distance
- neural network
- metric space
- vector space
- distance measure
- improved algorithm
- graph model
- similarity metric
- graph theoretic
- approximation methods
- search space
- travelling salesman
- genetic algorithm