A 4/3-approximation for TSP on cubic 3-edge-connected graphs.
Nishita AgarwalNaveen GargSwati GuptaPublished in: Oper. Res. Lett. (2018)
Keyphrases
- traveling salesman problem
- connected graphs
- edge detection
- edge information
- search space
- ant colony optimization
- genetic algorithm
- travelling salesman
- closed form
- approximation algorithms
- approximation error
- edge detector
- b spline
- neural network
- data sets
- approximation schemes
- satisfy the triangle inequality
- zero crossing
- weighted graph
- error bounds
- multiscale