Conference Proceedings

Some conplexity results for the traveling salesman problem

Proceedings of the Annual ACM Symposium on Theory of Computing (1976) Part F130841 1-9
DOI: 10.1145/800113.803625
30Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is shown that, unless P=NP, local search algorithms for the Traveling Salesman Problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal. The traveling Salesman Problem is also shown to be NP-Complete even if its instances are restricted to be realizable by a set of points on the Euclidean plane.

Cite

CITATION STYLE

APA

Papadimitriou, C. H., & Steiglitz, K. (1976). Some conplexity results for the traveling salesman problem. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F130841, pp. 1–9). Association for Computing Machinery. https://doi.org/10.1145/800113.803625

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free