"A faster 2-approximation algorithm for the minmax p-traveling salesmen ..."

Hiroshi Nagamochi, Kohei Okada (2004)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2003.06.001

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/NagamochiO04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/NagamochiO04
Hiroshi Nagamochi, Kohei Okada:
A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discret. Appl. Math. 140(1-3): 103-114 (2004)

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.