View Document Preview and Link Document Date: 2009-10-28 12:34:47 Open Document File Size: 196,06 KB Share Result on Facebook
Company See LP / SIAM Journal / symmetrized LP / Karp LP / Artificial Intelligence Laboratory / / / Event Force Majeure / / Facility Carnegie-Mellon University / Stanford University / / IndustryTerm polynomial-time algorithms / dual optimum solution / iterative algorithm / approximation algorithm / feasible solution / 3e unique solution / greedy algorithm / ellipsoid algorithm / extremepoint solution / optimum solution / tion algorithm / optimum extreme point solution / e - this / / Organization Graduate School / Industrial Administration / National Science Foundation / Department of Management Science and Engineering / MIT / Stanford University / Department of Mathematics / Carnegie-Mellon University / Pittsburgh / / Person Amin Saberi Shayan Oveis Gharan / Michel X. Goemans† Aleksander Madry / / / Position salesman / Asymmetric Traveling Salesman / / Product Hoffman / / ProgrammingLanguage T / / ProvinceOrState Pennsylvania / / SportsLeague Stanford University / / Technology ellipsoid algorithm / approximation Algorithm / polynomial-time algorithms / greedy algorithm / computing tion algorithm / Two algorithms / / URL http / SocialTag 
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†