The following pages link to (Q4472495):
Displaying 5 items.
- An approximation algorithm for the TSP (Q1119485) (← links)
- Experimental comparison of two heuristic algorithms for one generalization of the large-scale planar travelling-salesman problem (Q1183812) (← links)
- The traveling salesman problem with few inner points (Q2583717) (← links)
- Approximation algorithms for TSP with neighborhoods in the plane (Q2768270) (← links)
- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. (Abstract) (Q4395317) (← links)