"An Explicit Lower Bound for TSP with Distances One and Two."

Lars Engebretsen (2003)

> Home

Details and statistics

DOI: 10.1007/S00453-002-1001-6

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Engebretsen03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Engebretsen03
Lars Engebretsen:
An Explicit Lower Bound for TSP with Distances One and Two. Algorithmica 35(4): 301-318 (2003)

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.