Google Research

An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem

Proceedings of APPROX 2006, Springer

Abstract

No abstract available; check out the Download or Google Scholar links above for publications details.

Learn more about how we do research

We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work