Approximation Algorithms for Not Necessarily Disjoint Clustered TSP

Approximation Algorithms for Disjoint Paths

Approximation Algorithms for k-Delivery TSP

We provide O(1) approximation algorithms for the following NP-hard problem called k-Delivery TSP : We have at our disposal a truck of capacity k, and there are n depots and n customers at various locations in some metric space, and exactly one item (all of which are identical) at each depot. We want to nd an optimal tour using the truck to deliver one item to each customer. Our algorithms run i...

Improved deterministic approximation algorithms for Max TSP

We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17 20 . Both algorithms improve ...

Approximation Algorithms for Stochastic k-TSP

This paper studies the stochastic variant of the classical k-TSP problem where rewards at the vertices are independent random variables which are instantiated upon the tour’s visit. The objective is to minimize the expected length of a tour that collects reward at least k. The solution is a policy describing the tour which may (adaptive) or may not (non-adaptive) depend on the observed rewards....

Approximation Algorithms for Tsp and Triangulation 8

A dynamic programming approach to sequencing problems .