Answers are grounded in this paper and cite their sources.
We give an algorithm requiring O(c1/ε²n) time to find an ε-optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edge-lengths. For the case of all lengths equal to 1, the time required is O(c1/ε n).
No takes yet. Share an insight, caveat, or question.
Philip N. Klein (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: