Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

STACS
2010
Springer

favoriteEmaildiscussreport

205views Theoretical Computer Science» more STACS 2010»

The Traveling Salesman Problem under Squared Euclidean Distances

13 years 11 months ago

The Traveling Salesman Problem under Squared Euclidean Distances

Download www1.informatik.uni-wuerzburg.de

The Traveling Salesman Problem Under Squared Euclidean Distances

Fred van Nijnatten, René Sitters, Gerhard J

Real-time Traffic

STACS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Sigmadelta quantization errors and the traveling salesman problem

» Approximation Algorithms for the Minimum Bends Traveling Salesman Problem

» An Approximation Algorithm for a Bottleneck Traveling Salesman Problem

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

» Asymmetric Traveling Salesman Path and Directed Latency Problems

» Approximating TSP on metrics with bounded global growth

» Constructing Optimal Highways

» Heuristic algorithms for routesearch queries over geographical data

Post Info
More Details (n/a)

Added	14 May 2010
Updated	14 May 2010
Type	Conference
Year	2010
Where	STACS
Authors	Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, Alexander Wolff, Mark de Berg

Comments (0)