Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Complexity of Approximating Euclidean Traveling Salesman Tours and ..."

Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid (1997)

> Home

Details and statistics

DOI: 10.1007/PL00009183

access: closed

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DasKS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DasKS97
Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid:
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. Algorithmica 19(4): 447-460 (1997)

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.