External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees

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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on