Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations

DOI10.1016/0020-0190(87)90160-8zbMath0632.90080OpenAlexW2050895339MaRDI QIDQ1095812

Michael B. Dillencourt

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90160-8

zbMATH Keywords

minimum weight triangulationHamiltonian graphVoronoi diagramcomputational geometryDulaunay triangulationtraveling salesman cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38)

Related Items (7)

Novel concave hull-based heuristic algorithm for TSP ⋮ 2-change for k-connected networks ⋮ Hamiltonian triangulations and circumscribing polygons of disjoint line segments ⋮ Angle-restricted tours in the plane. ⋮ Matching points with squares ⋮ ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS ⋮ Toughness and Delaunay triangulations

Cites Work

• Unnamed Item
• Traveling salesman cycles are not always subgraphs of Voronoi duals

This page was built for publication: Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations