2000 character limit reached
An LP-based 3/2-approximation algorithm for the graphic s-t path TSP (1304.7055v1)
Published 26 Apr 2013 in cs.DS
Abstract: We design a new LP-based algorithm for the graphic $s$-$t$ path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Seb\H{o}.