Euclidean TSP between two nested convex obstacles

DOI10.1016/j.ipl.2005.04.002zbMath1185.68767OpenAlexW2022155980MaRDI QIDQ1041790

Jeff Abrahamson, Ali Shokoufandeh, Pawel Winter

Publication date: 4 December 2009

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

Full work available at URL: http://www.elsevier.com/locate/ipl

zbMATH Keywords

traveling salesman problemcomputational geometryconvex analysisnetwork flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

The \(x\)-and-\(y\)-axes travelling salesman problem ⋮ Euclidean TSP on two polygons

Cites Work

• Unnamed Item
• The convex-hull-and-line traveling salesman problem: A solvable case
• Efficient special case algorithms for the n-line planar traveling salesman problem
• The n-line traveling salesman problem
• Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths

This page was built for publication: Euclidean TSP between two nested convex obstacles