My UW | UW Search

   
   

Computer Science Home Page
 
 
 
Computer Sciences Dept.

An Almost Surely Optimal Algorithm for the Euclidean Traveling Salesman Problem

John Halton, Routo Terada
1978

Download this report (PDF)

Return to tech report index

 
Computer Science | UW Home

Feedback or content questions: send email to "pubs" at the cs.wisc.edu server
Technical or accessibility issues: lab@cs.wisc.edu
Copyright © 2002, 2003, 2004, 2005, 2006, 2007  The Board of Regents of the University of Wisconsin System.