Abstract :
Let A, |A|⩽n, be a subset of [0,1]d, and let L(A,[0,1]d,p) be the length of the minimal matching, the minimal spanning tree, or the traveling salesman problem on A with weight function w(e)=|e|p. In the case 1⩽p
Keywords :
Minimal matching , Minimal spanning tree , Traveling salesman problem
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics