Sciweavers

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

65

Voted

APPROX
2007
Springer

favoriteEmaildiscussreport

95views Algorithms» more APPROX 2007»

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

15 years 5 months ago

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

Download research.microsoft.com

Uriel Feige, Mohit Singh

Real-time Traffic

Algorithms | APPROX 2007 |

claim paper

Related Content

» The traveling salesman problem for lines and rays in the plane

» Asymmetric Traveling Salesman Path and Directed Latency Problems

» Improved Approximation Algorithms for Metric Max TSP

» Approximation Algorithms for the Directed kTour and kStroll Problems

» Data gathering tours for mobile robots

» Improved Approximation for the Directed Spanner Problem

» Improved Orientations of Physical Networks

» Differential approximation results for the traveling salesman and related problems

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

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	APPROX
Authors	Uriel Feige, Mohit Singh

Comments (0)