A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem

Details A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem

2009-09-04

arxiv.org/abs/0909.0941v1

Computer Science

Data Structures and Algorithms

Scientific paper

We present an algorithm for the asymmetric traveling salesman problem on
instances which satisfy the triangle inequality. Like several existing
algorithms, it achieves approximation ratio O(log n). Unlike previous
algorithms, it uses randomized rounding.

Affiliated with

Also associated with

No associations

Rating

A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36411