An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem

16 years 6 days ago

Download kam.mff.cuni.cz

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

Asymmetric Traveling Salesman | Discrete Algorithms | Log N | Randomized Algorithm | SODA 2010 |

claim paper

» Asymmetric Traveling Salesman Path and Directed Latency Problems

» Approximation Algorithms for the Directed kTour and kStroll Problems

» Approximate Shortest Paths in Anisotropic Regions

» Dynamic and Nonuniform Pricing Strategies for Revenue Maximization

» The Directed Minimum Latency Problem

» On Approximating MultiCriteria TSP

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
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

Asymmetric Traveling Salesman | Discrete Algorithms | Log N | Randomized Algorithm | SODA 2010 |

Explore & Download

Productivity Tools

Sciweavers