We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...