Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
33
click to vote
STACS
2010
Springer
favorite
Email
discuss
report
205
views
Theoretical Computer Science
»
more
STACS 2010
»
The Traveling Salesman Problem under Squared Euclidean Distances
14 years 3 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision