Spacefilling Curves and the Planar Travelling Salesman Problem

133Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

Abstract

To construct a short tour through points in the plane, the points are sequenced as they appear along a spacefilling curve. This heuristic consists essentially of sorting, so it is easily coded and requires only O1989 memory and O(N log N) operations. Its performance is competitive with that of other fast methods. © 1989, ACM. All rights reserved.

References Powered by Scopus

The shortest path through many points

654Citations
N/AReaders
Get full text

The Euclidean travelling salesman problem is NP-complete

564Citations
N/AReaders
Get full text

HEURISTICS BASED ON SPAECEFILLING CURVES FOR COMBINATORIAL PROBLEMS IN EUCLIDEAN SPACE.

102Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Stochastic local search: Foundations and applications

732Citations
N/AReaders
Get full text

Stochastic and dynamic networks and routing

252Citations
N/AReaders
Get full text

Local optimization and the traveling salesman problem

234Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Platzman, L. K., & Bartholdi, J. J. (1989). Spacefilling Curves and the Planar Travelling Salesman Problem. Journal of the ACM (JACM), 36(4), 719–737. https://doi.org/10.1145/76359.76361

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 16

52%

Professor / Associate Prof. 7

23%

Researcher 7

23%

Lecturer / Post doc 1

3%

Readers' Discipline

Tooltip

Computer Science 13

43%

Engineering 12

40%

Mathematics 3

10%

Business, Management and Accounting 2

7%

Article Metrics

Tooltip
Mentions
References: 2

Save time finding and organizing research with Mendeley

Sign up for free