"The Euclidean Traveling Salesman Problem is NP-Complete."

Christos H. Papadimitriou (1977)

> Home

Details and statistics

DOI: 10.1016/0304-3975(77)90012-3

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Papadimitriou77
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Papadimitriou77
Christos H. Papadimitriou:
The Euclidean Traveling Salesman Problem is NP-Complete. Theor. Comput. Sci. 4(3): 237-244 (1977)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.