No label defined (Q3216469)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3882232
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3882232

      Statements

      0 references
      0 references
      1982
      0 references
      intersection elimination algorithm
      0 references
      polynomial time
      0 references
      approximation algorithms
      0 references
      traveling salesman
      0 references
      intersecting edges
      0 references
      [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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references