9 search results - page 1 / 2 » The Traveling Salesman Problem under Squared Euclidean Dista... |
STACS
2010
Springer
13 years 11 months ago
2010
Springer
The Traveling Salesman Problem Under Squared Euclidean Distances
ADCM
2008
13 years 4 months ago
2008
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
IPCO
2001
13 years 6 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...