A (Slightly) Improved Approximation Algorithm for Metric TSP Page 1 A (Slightly) Improved
Approximation Algorithm for Metric TSP Anna R. Karlin karlin@cs.washington.edu …

Aim The nestedness temperature of presence–absence matrices is currently calculated with
the nestedness temperature calculator (NTC). In the algorithm implemented by the NTC:(1) …

For some positive constant ϵ 0, we give a (3/2-ϵ 0)-approximation algorithm for the
following problem: given a graph G 0=(V, V 0), find the shortest tour that visits every vertex at …

We prove new results for approximating the graph-TSP and some related problems. We
obtain polynomial-time algorithms with improved approximation guarantees. For the graph …

We present a framework for approximating the metric TSP based on a novel use of
matchings. Traditionally, matchings have been used to add edges in order to make a given …

We present a framework for approximating the metric TSP based on a novel use of
matchings. Traditionally, matchings have been used to add edges to make a given graph …

We give a systematic study of Hamiltonicity of grids—the graphs induced by finite subsets of
vertices of the tilings of the plane with congruent regular convex polygons (triangles …

We study the capacitated vehicle routing problem in graphic metrics (graphic CVRP). Our
main contribution is a new lower bound on the cost of an optimal solution. For graphic …

We design a 1.49993-approximation algorithm for the metric traveling salesperson problem
(TSP) for instances in which an optimal solution to the subtour linear programming …

In the traveling salesman path problem, we are given a set of cities, traveling costs between
city pairs and fixed source and destination cities. The objective is to find a minimum cost …