"Approximation Algorithms for Asymmetric TSP by Decomposing Directed ..."

Haim Kaplan et al. (2003)

> Home

Details and statistics

DOI: 10.1109/SFCS.2003.1238181

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/focs/KaplanLSS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/KaplanLSS03
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65

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.