9 search results - page 2 / 2 » The Traveling Salesman Problem under Squared Euclidean Dista... |
131
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
119
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
121
Voted
CATS
2007
15 years 3 months ago
2007
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
103
Voted
GIS
2008
ACM
15 years 2 months ago
2008
ACM
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...