An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

13 years 2 months ago

Download www.stanford.edu

We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.

Arash Asadpour, Michel X. Goemans, Aleksander Madr

Real-time Traffic

Algorithms | Randomized Algorithm | Salesman Problem | SODA 2010 | Triangle Inequality |

claim paper

» An Olog nlog log napproximation algorithm for the asymmetric traveling salesman problem

» Asymmetric Traveling Salesman Path and Directed Latency Problems

» Approximation Algorithms for the Directed kTour and kStroll Problems

» Approximate Shortest Paths in Anisotropic Regions

» The Directed Minimum Latency Problem

» Covering Rectilinear Polygons with AxisParallel Rectangles

» Edge ranking and searching in partial orders

» Approximation Algorithms for Orienteering with Time Windows

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	SODA
Authors	Arash Asadpour, Michel X. Goemans, Aleksander Madry, Shayan Oveis Gharan, Amin Saberi

Comments (0)

Sciweavers

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem

Algorithms | Randomized Algorithm | Salesman Problem | SODA 2010 | Triangle Inequality |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers