Spacefilling curves and the planar travelling salesman problem

DOI10.1145/76359.76361zbMath0697.68047MaRDI QIDQ3474889

John J. III Bartholdi, L. K. Platzman

Publication date: 1989

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/76359.76361

zbMATH Keywords

fractal geometry; sequencing and scheduling; spacefilling curves; routing and layout

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Applications of the space — filling curves with data driven measure — preserving property, Match twice and stitch: a new TSP tour construction heuristic., Algorithms for the universal and a priori TSP, Submodularity and the traveling salesman problem, The Guilty net for the traveling salesman problem, Constructing competitive tours from local information, Neural methods for the traveling salesman problem: Insights from operations research, Routing heuristics for automated pick and place machines, On properties of geometric random problems in the plane, Indian kolam patterns, sand drawings in the Vanuatu Islands, the Sierpiński curve, and monoid morphisms, ``Conscientious neural nets for tour construction in the traveling salesman problem: The vigilant net