Running summarizing tools on a new article
Check the paper below, then start its synthesis.
An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
Zhihan Gao
arXiv: 1304.7055v1 (cs.DS)
License: CC BY-NC-SA 3.0
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ő.
Submitted to arXiv on 26 Apr. 2013