We study the metric s-t path Traveling Salesman Problem (TSP). [An, Kleinberg, and Shmoys, STOC 2012] improved on the long standing 5 3 -approximation factor and presented an algorithm that achieves an approximation factor of 1+ √ 5 2 ≈ 1.61803. Later [Sebő, IPCO 2013] further improved the approximation factor to 85 . We present a simple, self-contained analysis that unifies both results; our m...