English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees

Das, G., Kapoor, S., & Smid, M. (1997). On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. Algorithmica, 19, 447-460.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Das, Gautam1, Author           
Kapoor, Sanjiv1, Author           
Smid, Michiel1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021997
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 518014
Other: Local-ID: C1256428004B93B8-CE15E244BDCE3C21C1256745002F5F55-Das-Kapoor-Smid97
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 19 Sequence Number: - Start / End Page: 447 - 460 Identifier: ISSN: 0178-4617