default search action

combined dblp search
author search
venue search
publication search

ask others

"A Special Case of the n-Vertex Traveling-Salesman Problem that can be ..."

James K. Park (1991)

> Home

Details and statistics

DOI: 10.1016/0020-0190(91)90118-2

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Park91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Park91
James K. Park:
A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time. Inf. Process. Lett. 40(5): 247-254 (1991)

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.