Traveling salesman cycles are not always subgraphs of Voronoi duals
From MaRDI portal
Publication:1055435
DOI10.1016/0020-0190(83)90004-2zbMath0521.05045OpenAlexW1986590274MaRDI QIDQ1055435
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90004-2
Related Items (10)
Novel concave hull-based heuristic algorithm for TSP ⋮ Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations ⋮ 2-change for k-connected networks ⋮ A non-Hamiltonian, nondegenerate Delaunay triangulation ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ An upper bound on the shortness exponent of inscribable polytopes ⋮ A simple method for resolving degeneracies in Delaunay triangulations ⋮ Hamiltonian triangulations and circumscribing polygons of disjoint line segments ⋮ Testing the necklace condition for shortest tours and optimal factors in the plane ⋮ Toughness and Delaunay triangulations
Cites Work
This page was built for publication: Traveling salesman cycles are not always subgraphs of Voronoi duals
