Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Fast minimum-weight double-tree shortcutting for metric TSP: Is the best ..."

Vladimir G. Deineko, Alexander Tiskin (2009)

> Home

Details and statistics

DOI: 10.1145/1498698.1594232

access: closed

type: Journal Article

metadata version: 2020-06-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jea/DeinekoT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jea/DeinekoT09
Vladimir G. Deineko, Alexander Tiskin:
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? ACM J. Exp. Algorithmics 14 (2009)

a service of

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.