Jul 3, 2009 · In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency ...

We study integrality gaps and approximability of three closely related problems on directed graphs with edge lengths that satisfy the triangle inequality.

In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency problem, the ...

In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency problem, the ...

In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency problem, the ...

Apr 3, 2013 · Abstract. We study integrality gaps and approximability of three closely related problems on directed graphs with edge lengths that satisfy ...

In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total cost of this path. In the directed latency problem, the ...

Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs · Faster approximation algorithms for the minimum latency problem · The ...

In the asymmetric traveling salesman path problem (ATSPP), the objective is to minimize the total length of this path. In the directed latency problem, the ...

In this paper, we consider the minimum latency problem on asymmetric metrics. Network design problems on directed graphs are often much harder to approxi- mate ...