scientific article; zbMATH DE number 3882232

From MaRDI portal
Publication:3216469





[For the entire collection see Zbl 0527.00031.] Known approximation algorithms for the traveling salesman problem in the plane produce tours which can still contain intersecting edges. We prove that the common procedure to remove all intersections from a tour without increasing its length, is guaranteed to terminate within polynomially many steps.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216469)