A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem
Data Structures and Algorithms
2009-09-07 v1
Abstract
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.
Cite
@article{arxiv.0909.0941,
title = {A Randomized Rounding Algorithm for the Asymmetric Traveling Salesman Problem},
author = {Michel X. Goemans and Nicholas J. A. Harvey and Kamal Jain and Mohit Singh},
journal= {arXiv preprint arXiv:0909.0941},
year = {2009}
}