6 citations · 19 across the 16 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DM2015
Better --Tours by Gao Trees
Corinna Gottschalk, Jens Vygen
We consider the --path TSP: given a finite metric space with two elements and , we look for a path from to that contains all the elements and has minimum total…
cs.DM2015★ 1 cited
Reassembling trees for the traveling salesman
Jens Vygen
Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution…