"Approximation algorithms for asymmetric TSP by decomposing directed ..."

Haim Kaplan et al. (2005)

> Home

Details and statistics

DOI: 10.1145/1082036.1082041

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/KaplanLSS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/KaplanLSS05
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005)

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.