pith. sign in

arxiv: math/0610385 · v1 · submitted 2006-10-11 · 🧮 math.CO · math.MG

An Efficient Approximation of the Traveling Salesman Polytope Using Lifting Methods

classification 🧮 math.CO math.MG
keywords polytopeapproximationcontainedfacetssalesmantravelingboundarycertain
0
0 comments X
read the original abstract

For the Traveling Salesman Polytope on n cities T_n, we construct its approximation Q_k, k=1, 2, . . ., n^(1/3) using a projection of a polytope whose number of facets is polynomial in n (of degree linear in k). We show that T_n is contained in Q_k for each k, and that the scaling of Q_k by k/n+O(1/n) is contained in T_n for each k. We show that certain facets of T_n lie on the boundary of Q_k.

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.