Approximating Graphic TSP by Matchings

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 graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost.

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Tobias Mömke, Ola Svensson
• Keywords: CORR 2011, Education, Graph Eulerian, Metric Tsp