English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

Das, G., Kapoor, S., & Smid, M. (1996). On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. In V. Chandru, & V. Vinay (Eds.), Foundations of software technology and theoretical computer science (FSTTCS-96): 16th conference (pp. 64-75). Berlin, Germany: Springer.

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-021996
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517771
Other: Local-ID: C1256428004B93B8-78ADA2C4CA0EA6CAC12564C300289F45-Das-Kapoor-Smid96
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Hyderabad, India
Start-/End Date: 1996-12-18 - 1996-12-20

Legal Case

show

Project information

show

Source 1

show
hide
Title: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference
Source Genre: Proceedings
 Creator(s):
Chandru, V., Editor
Vinay, V., Editor
Affiliations:
-
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 64 - 75 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -