Approximate TSP in Graphs with Forbidden Minors [chapter]

Michelangelo Grigni
2000 Lecture Notes in Computer Science  
Given as input an edge-weighted graph, we analyze two algorithms for nding subgraphs with low total edge weight. The rst algorithm nds a separator subgraph with a small number of components, and is analyzed for graphs with an arbitrary excluded minor. The second algorithm nds a spanner with small stretch factor, and is analyzed for graphs in a hereditary family G(k). These results imply (i) a QPTAS (quasi-polynomial time approximation scheme) for the TSP (traveling salesperson problem) in
more » ... hted graphs with an excluded minor, and (ii) a QPTAS for the TSP in weighted graphs with bounded genus.
doi:10.1007/3-540-45022-x_73 fatcat:s3un4gipwfevhfyho2rfho4iiy