"The Parallel Complexity of TSP Heuristics."

Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys (1989)

> Home

Details and statistics

DOI: 10.1016/0196-6774(89)90015-1

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/KindervaterLS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/KindervaterLS89
Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys:
The Parallel Complexity of TSP Heuristics. J. Algorithms 10(2): 249-270 (1989)

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.