Fred van Nijnatten

Learn More
Let P be a set of points in R d , and let α 1 be a real number. We define the distance between two points p, q ∈ P as |pq| α , where |pq| denotes the standard Euclidean distance between p and q. We denote the traveling salesman problem under this distance function by Tsp(d, α). We design a 5-approximation algorithm for Tsp(2,2) and generalize this result to(More)
  • 1