An LP-based 3/2-approximation algorithm for the graphic s-t path TSP
classification
💻 cs.DS
keywords
algorithmapproximationgraphiclp-basedpathachievesanswersbest
read the original 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}.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.