Introduces Fréchet TSP for two coordinated curves, with a near-linear algorithm for the discrete case and NP-hardness for the continuous case.
The multiple traveling salesman problem: an overview of formulations and solution procedures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Fr\'echet Traveling Salesmen Problems
Introduces Fréchet TSP for two coordinated curves, with a near-linear algorithm for the discrete case and NP-hardness for the continuous case.